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

Theorem reusv3 4282
Description: Two ways to express single-valuedness of a class expression 𝐶(𝑦). See reusv1 4280 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 2156 . . . . 5 (𝑦 = 𝑧 → (𝐶𝐴𝐷𝐴))
41, 3anbi12d 457 . . . 4 (𝑦 = 𝑧 → ((𝜑𝐶𝐴) ↔ (𝜓𝐷𝐴)))
54cbvrexv 2591 . . 3 (∃𝑦𝐵 (𝜑𝐶𝐴) ↔ ∃𝑧𝐵 (𝜓𝐷𝐴))
6 nfra2xy 2418 . . . . 5 𝑧𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷)
7 nfv 1466 . . . . 5 𝑧𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)
86, 7nfim 1509 . . . 4 𝑧(∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))
9 risset 2406 . . . . . 6 (𝐷𝐴 ↔ ∃𝑥𝐴 𝑥 = 𝐷)
10 ralcom 2530 . . . . . . . . . . . . . 14 (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∀𝑧𝐵𝑦𝐵 ((𝜑𝜓) → 𝐶 = 𝐷))
11 impexp 259 . . . . . . . . . . . . . . . . . 18 (((𝜑𝜓) → 𝐶 = 𝐷) ↔ (𝜑 → (𝜓𝐶 = 𝐷)))
12 bi2.04 246 . . . . . . . . . . . . . . . . . 18 ((𝜑 → (𝜓𝐶 = 𝐷)) ↔ (𝜓 → (𝜑𝐶 = 𝐷)))
1311, 12bitri 182 . . . . . . . . . . . . . . . . 17 (((𝜑𝜓) → 𝐶 = 𝐷) ↔ (𝜓 → (𝜑𝐶 = 𝐷)))
1413ralbii 2384 . . . . . . . . . . . . . . . 16 (∀𝑦𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∀𝑦𝐵 (𝜓 → (𝜑𝐶 = 𝐷)))
15 r19.21v 2450 . . . . . . . . . . . . . . . 16 (∀𝑦𝐵 (𝜓 → (𝜑𝐶 = 𝐷)) ↔ (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
1614, 15bitri 182 . . . . . . . . . . . . . . 15 (∀𝑦𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
1716ralbii 2384 . . . . . . . . . . . . . 14 (∀𝑧𝐵𝑦𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∀𝑧𝐵 (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
1810, 17bitri 182 . . . . . . . . . . . . 13 (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∀𝑧𝐵 (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
19 rsp 2423 . . . . . . . . . . . . 13 (∀𝑧𝐵 (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷)) → (𝑧𝐵 → (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷))))
2018, 19sylbi 119 . . . . . . . . . . . 12 (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → (𝑧𝐵 → (𝜓 → ∀𝑦𝐵 (𝜑𝐶 = 𝐷))))
2120com3l 80 . . . . . . . . . . 11 (𝑧𝐵 → (𝜓 → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∀𝑦𝐵 (𝜑𝐶 = 𝐷))))
2221imp31 252 . . . . . . . . . 10 (((𝑧𝐵𝜓) ∧ ∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷)) → ∀𝑦𝐵 (𝜑𝐶 = 𝐷))
23 eqeq1 2094 . . . . . . . . . . . . 13 (𝑥 = 𝐷 → (𝑥 = 𝐶𝐷 = 𝐶))
24 eqcom 2090 . . . . . . . . . . . . 13 (𝐷 = 𝐶𝐶 = 𝐷)
2523, 24syl6bb 194 . . . . . . . . . . . 12 (𝑥 = 𝐷 → (𝑥 = 𝐶𝐶 = 𝐷))
2625imbi2d 228 . . . . . . . . . . 11 (𝑥 = 𝐷 → ((𝜑𝑥 = 𝐶) ↔ (𝜑𝐶 = 𝐷)))
2726ralbidv 2380 . . . . . . . . . 10 (𝑥 = 𝐷 → (∀𝑦𝐵 (𝜑𝑥 = 𝐶) ↔ ∀𝑦𝐵 (𝜑𝐶 = 𝐷)))
2822, 27syl5ibrcom 155 . . . . . . . . 9 (((𝑧𝐵𝜓) ∧ ∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷)) → (𝑥 = 𝐷 → ∀𝑦𝐵 (𝜑𝑥 = 𝐶)))
2928reximdv 2474 . . . . . . . 8 (((𝑧𝐵𝜓) ∧ ∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷)) → (∃𝑥𝐴 𝑥 = 𝐷 → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)))
3029ex 113 . . . . . . 7 ((𝑧𝐵𝜓) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → (∃𝑥𝐴 𝑥 = 𝐷 → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))))
3130com23 77 . . . . . 6 ((𝑧𝐵𝜓) → (∃𝑥𝐴 𝑥 = 𝐷 → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))))
329, 31syl5bi 150 . . . . 5 ((𝑧𝐵𝜓) → (𝐷𝐴 → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))))
3332expimpd 355 . . . 4 (𝑧𝐵 → ((𝜓𝐷𝐴) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶))))
348, 33rexlimi 2482 . . 3 (∃𝑧𝐵 (𝜓𝐷𝐴) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)))
355, 34sylbi 119 . 2 (∃𝑦𝐵 (𝜑𝐶𝐴) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) → ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)))
361, 2reusv3i 4281 . 2 (∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶) → ∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷))
3735, 36impbid1 140 1 (∃𝑦𝐵 (𝜑𝐶𝐴) → (∀𝑦𝐵𝑧𝐵 ((𝜑𝜓) → 𝐶 = 𝐷) ↔ ∃𝑥𝐴𝑦𝐵 (𝜑𝑥 = 𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1289  wcel 1438  wral 2359  wrex 2360
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ral 2364  df-rex 2365
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator