Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  reusv3 GIF version

Theorem reusv3 4192
 Description: Two ways to express single-valuedness of a class expression 𝐶(𝑦). See reusv1 4190 for the connection to uniqueness. (Contributed by NM, 27-Dec-2012.)
Hypotheses
Ref Expression
reusv3.1 (𝑦 = 𝑧 → (𝜑𝜓))
reusv3.2 (𝑦 = 𝑧𝐶 = 𝐷)
Assertion
Ref Expression
reusv3 (∃𝑦𝐵 (𝜑𝐶𝐴) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐶,𝑧   𝑥,𝐷,𝑦   𝜑,𝑥,𝑧   𝜓,𝑥,𝑦   𝑥,𝐴,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑦)   𝜓(𝑧)   𝐶(𝑦)   𝐷(𝑧)

Proof of Theorem reusv3
StepHypRef Expression
1 reusv3.1 . . . . 5 (𝑦 = 𝑧 → (𝜑𝜓))
2 reusv3.2 . . . . . 6 (𝑦 = 𝑧𝐶 = 𝐷)
32eleq1d 2106 . . . . 5 (𝑦 = 𝑧 → (𝐶𝐴𝐷𝐴))
41, 3anbi12d 442 . . . 4 (𝑦 = 𝑧 → ((𝜑𝐶𝐴) ↔ (𝜓𝐷𝐴)))
54cbvrexv 2534 . . 3 (∃𝑦𝐵 (𝜑𝐶𝐴) ↔ ∃𝑧𝐵 (𝜓𝐷𝐴))
6 nfra2xy 2364 . . . . 5 𝑧𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷)
7 nfv 1421 . . . . 5 𝑧𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)
86, 7nfim 1464 . . . 4 𝑧(∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))
9 risset 2352 . . . . . 6 (𝐷𝐴 ↔ ∃𝑥𝐴 𝑥 = 𝐷)
10 ralcom 2473 . . . . . . . . . . . . . 14 (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∀𝑧𝐵𝑦𝐵 ((𝜑𝜓) → 𝐶 = 𝐷))
11 impexp 250 . . . . . . . . . . . . . . . . . 18 (((𝜑𝜓) → 𝐶 = 𝐷) ↔ (𝜑 → (𝜓𝐶 = 𝐷)))
12 bi2.04 237 . . . . . . . . . . . . . . . . . 18 ((𝜑 → (𝜓𝐶 = 𝐷)) ↔ (𝜓 → (𝜑𝐶 = 𝐷)))
1311, 12bitri 173 . . . . . . . . . . . . . . . . 17 (((𝜑𝜓) → 𝐶 = 𝐷) ↔ (𝜓 → (𝜑𝐶 = 𝐷)))
1413ralbii 2330 . . . . . . . . . . . . . . . 16 (∀𝑦𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∀𝑦𝐵 (𝜓 → (𝜑𝐶 = 𝐷)))
15 r19.21v 2396 . . . . . . . . . . . . . . . 16 (∀𝑦𝐵 (𝜓 → (𝜑𝐶 = 𝐷)) ↔ (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
1614, 15bitri 173 . . . . . . . . . . . . . . 15 (∀𝑦𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
1716ralbii 2330 . . . . . . . . . . . . . 14 (∀𝑧𝐵𝑦𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∀𝑧𝐵 (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
1810, 17bitri 173 . . . . . . . . . . . . 13 (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∀𝑧𝐵 (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
19 rsp 2369 . . . . . . . . . . . . 13 (∀𝑧𝐵 (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)) → (𝑧𝐵 → (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷))))
2018, 19sylbi 114 . . . . . . . . . . . 12 (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → (𝑧𝐵 → (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷))))
2120com3l 75 . . . . . . . . . . 11 (𝑧𝐵 → (𝜓 → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∀𝑦𝐵 (𝜑𝐶 = 𝐷))))
2221imp31 243 . . . . . . . . . 10 (((𝑧𝐵𝜓) ∧ ∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷)) → ∀𝑦𝐵 (𝜑𝐶 = 𝐷))
23 eqeq1 2046 . . . . . . . . . . . . 13 (𝑥 = 𝐷 → (𝑥 = 𝐶𝐷 = 𝐶))
24 eqcom 2042 . . . . . . . . . . . . 13 (𝐷 = 𝐶𝐶 = 𝐷)
2523, 24syl6bb 185 . . . . . . . . . . . 12 (𝑥 = 𝐷 → (𝑥 = 𝐶𝐶 = 𝐷))
2625imbi2d 219 . . . . . . . . . . 11 (𝑥 = 𝐷 → ((𝜑𝑥 = 𝐶) ↔ (𝜑𝐶 = 𝐷)))
2726ralbidv 2326 . . . . . . . . . 10 (𝑥 = 𝐷 → (∀𝑦𝐵 (𝜑𝑥 = 𝐶) ↔ ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
2822, 27syl5ibrcom 146 . . . . . . . . 9 (((𝑧𝐵𝜓) ∧ ∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷)) → (𝑥 = 𝐷 → ∀𝑦𝐵 (𝜑𝑥 = 𝐶)))
2928reximdv 2420 . . . . . . . 8 (((𝑧𝐵𝜓) ∧ ∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷)) → (∃𝑥𝐴 𝑥 = 𝐷 → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)))
3029ex 108 . . . . . . 7 ((𝑧𝐵𝜓) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → (∃𝑥𝐴 𝑥 = 𝐷 → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))))
3130com23 72 . . . . . 6 ((𝑧𝐵𝜓) → (∃𝑥𝐴 𝑥 = 𝐷 → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))))
329, 31syl5bi 141 . . . . 5 ((𝑧𝐵𝜓) → (𝐷𝐴 → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))))
3332expimpd 345 . . . 4 (𝑧𝐵 → ((𝜓𝐷𝐴) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))))
348, 33rexlimi 2426 . . 3 (∃𝑧𝐵 (𝜓𝐷𝐴) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)))
355, 34sylbi 114 . 2 (∃𝑦𝐵 (𝜑𝐶𝐴) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)))
361, 2reusv3i 4191 . 2 (∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶) → ∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷))
3735, 36impbid1 130 1 (∃𝑦𝐵 (𝜑𝐶𝐴) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   = wceq 1243   ∈ wcel 1393  ∀wral 2306  ∃wrex 2307 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022 This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator