Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  unirep Structured version   Visualization version   GIF version

Theorem unirep 33136
Description: Define a quantity whose definition involves a choice of representative, but which is uniquely determined regardless of the choice. (Contributed by Jeff Madsen, 1-Jun-2011.)
Hypotheses
Ref Expression
unirep.1 (𝑦 = 𝐷 → (𝜑𝜓))
unirep.2 (𝑦 = 𝐷𝐵 = 𝐶)
unirep.3 (𝑦 = 𝑧 → (𝜑𝜒))
unirep.4 (𝑦 = 𝑧𝐵 = 𝐹)
unirep.5 𝐵 ∈ V
Assertion
Ref Expression
unirep ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → (℩𝑥𝑦𝐴 (𝜑𝑥 = 𝐵)) = 𝐶)
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑧   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝑥,𝐹,𝑦   𝜑,𝑥,𝑧   𝜓,𝑥,𝑦   𝜒,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑦)   𝜓(𝑧)   𝜒(𝑧)   𝐵(𝑦)   𝐶(𝑧)   𝐷(𝑧)   𝐹(𝑧)

Proof of Theorem unirep
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 eqidd 2622 . . . . 5 (𝜓𝐶 = 𝐶)
21ancli 573 . . . 4 (𝜓 → (𝜓𝐶 = 𝐶))
3 unirep.1 . . . . . 6 (𝑦 = 𝐷 → (𝜑𝜓))
4 unirep.2 . . . . . . 7 (𝑦 = 𝐷𝐵 = 𝐶)
54eqeq2d 2631 . . . . . 6 (𝑦 = 𝐷 → (𝐶 = 𝐵𝐶 = 𝐶))
63, 5anbi12d 746 . . . . 5 (𝑦 = 𝐷 → ((𝜑𝐶 = 𝐵) ↔ (𝜓𝐶 = 𝐶)))
76rspcev 3295 . . . 4 ((𝐷𝐴 ∧ (𝜓𝐶 = 𝐶)) → ∃𝑦𝐴 (𝜑𝐶 = 𝐵))
82, 7sylan2 491 . . 3 ((𝐷𝐴𝜓) → ∃𝑦𝐴 (𝜑𝐶 = 𝐵))
98adantl 482 . 2 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → ∃𝑦𝐴 (𝜑𝐶 = 𝐵))
10 nfcvd 2762 . . . . . 6 (𝐷𝐴𝑦𝐶)
1110, 4csbiegf 3538 . . . . 5 (𝐷𝐴𝐷 / 𝑦𝐵 = 𝐶)
12 unirep.5 . . . . . 6 𝐵 ∈ V
1312csbex 4753 . . . . 5 𝐷 / 𝑦𝐵 ∈ V
1411, 13syl6eqelr 2707 . . . 4 (𝐷𝐴𝐶 ∈ V)
1514ad2antrl 763 . . 3 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → 𝐶 ∈ V)
16 eqeq1 2625 . . . . . . . . . . 11 (𝑥 = 𝐶 → (𝑥 = 𝐵𝐶 = 𝐵))
1716anbi2d 739 . . . . . . . . . 10 (𝑥 = 𝐶 → ((𝜑𝑥 = 𝐵) ↔ (𝜑𝐶 = 𝐵)))
1817rexbidv 3045 . . . . . . . . 9 (𝑥 = 𝐶 → (∃𝑦𝐴 (𝜑𝑥 = 𝐵) ↔ ∃𝑦𝐴 (𝜑𝐶 = 𝐵)))
1918spcegv 3280 . . . . . . . 8 (𝐶 ∈ V → (∃𝑦𝐴 (𝜑𝐶 = 𝐵) → ∃𝑥𝑦𝐴 (𝜑𝑥 = 𝐵)))
2014, 19syl 17 . . . . . . 7 (𝐷𝐴 → (∃𝑦𝐴 (𝜑𝐶 = 𝐵) → ∃𝑥𝑦𝐴 (𝜑𝑥 = 𝐵)))
2120adantr 481 . . . . . 6 ((𝐷𝐴𝜓) → (∃𝑦𝐴 (𝜑𝐶 = 𝐵) → ∃𝑥𝑦𝐴 (𝜑𝑥 = 𝐵)))
228, 21mpd 15 . . . . 5 ((𝐷𝐴𝜓) → ∃𝑥𝑦𝐴 (𝜑𝑥 = 𝐵))
2322adantl 482 . . . 4 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → ∃𝑥𝑦𝐴 (𝜑𝑥 = 𝐵))
24 r19.29 3065 . . . . . . . 8 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ ∃𝑦𝐴 (𝜑𝑥 = 𝐵)) → ∃𝑦𝐴 (∀𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝜑𝑥 = 𝐵)))
25 r19.29 3065 . . . . . . . . . . . 12 ((∀𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ ∃𝑧𝐴 (𝜒𝑤 = 𝐹)) → ∃𝑧𝐴 (((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝜒𝑤 = 𝐹)))
26 an4 864 . . . . . . . . . . . . . . . . 17 (((𝜑𝑥 = 𝐵) ∧ (𝜒𝑤 = 𝐹)) ↔ ((𝜑𝜒) ∧ (𝑥 = 𝐵𝑤 = 𝐹)))
27 pm3.35 610 . . . . . . . . . . . . . . . . . . . 20 (((𝜑𝜒) ∧ ((𝜑𝜒) → 𝐵 = 𝐹)) → 𝐵 = 𝐹)
28 eqeq12 2634 . . . . . . . . . . . . . . . . . . . 20 ((𝑥 = 𝐵𝑤 = 𝐹) → (𝑥 = 𝑤𝐵 = 𝐹))
2927, 28syl5ibrcom 237 . . . . . . . . . . . . . . . . . . 19 (((𝜑𝜒) ∧ ((𝜑𝜒) → 𝐵 = 𝐹)) → ((𝑥 = 𝐵𝑤 = 𝐹) → 𝑥 = 𝑤))
3029ancoms 469 . . . . . . . . . . . . . . . . . 18 ((((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝜑𝜒)) → ((𝑥 = 𝐵𝑤 = 𝐹) → 𝑥 = 𝑤))
3130expimpd 628 . . . . . . . . . . . . . . . . 17 (((𝜑𝜒) → 𝐵 = 𝐹) → (((𝜑𝜒) ∧ (𝑥 = 𝐵𝑤 = 𝐹)) → 𝑥 = 𝑤))
3226, 31syl5bi 232 . . . . . . . . . . . . . . . 16 (((𝜑𝜒) → 𝐵 = 𝐹) → (((𝜑𝑥 = 𝐵) ∧ (𝜒𝑤 = 𝐹)) → 𝑥 = 𝑤))
3332ancomsd 470 . . . . . . . . . . . . . . 15 (((𝜑𝜒) → 𝐵 = 𝐹) → (((𝜒𝑤 = 𝐹) ∧ (𝜑𝑥 = 𝐵)) → 𝑥 = 𝑤))
3433expdimp 453 . . . . . . . . . . . . . 14 ((((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝜒𝑤 = 𝐹)) → ((𝜑𝑥 = 𝐵) → 𝑥 = 𝑤))
3534rexlimivw 3022 . . . . . . . . . . . . 13 (∃𝑧𝐴 (((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝜒𝑤 = 𝐹)) → ((𝜑𝑥 = 𝐵) → 𝑥 = 𝑤))
3635imp 445 . . . . . . . . . . . 12 ((∃𝑧𝐴 (((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝜒𝑤 = 𝐹)) ∧ (𝜑𝑥 = 𝐵)) → 𝑥 = 𝑤)
3725, 36sylan 488 . . . . . . . . . . 11 (((∀𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ ∃𝑧𝐴 (𝜒𝑤 = 𝐹)) ∧ (𝜑𝑥 = 𝐵)) → 𝑥 = 𝑤)
3837an32s 845 . . . . . . . . . 10 (((∀𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝜑𝑥 = 𝐵)) ∧ ∃𝑧𝐴 (𝜒𝑤 = 𝐹)) → 𝑥 = 𝑤)
3938ex 450 . . . . . . . . 9 ((∀𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝜑𝑥 = 𝐵)) → (∃𝑧𝐴 (𝜒𝑤 = 𝐹) → 𝑥 = 𝑤))
4039rexlimivw 3022 . . . . . . . 8 (∃𝑦𝐴 (∀𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝜑𝑥 = 𝐵)) → (∃𝑧𝐴 (𝜒𝑤 = 𝐹) → 𝑥 = 𝑤))
4124, 40syl 17 . . . . . . 7 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ ∃𝑦𝐴 (𝜑𝑥 = 𝐵)) → (∃𝑧𝐴 (𝜒𝑤 = 𝐹) → 𝑥 = 𝑤))
4241expimpd 628 . . . . . 6 (∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) → ((∃𝑦𝐴 (𝜑𝑥 = 𝐵) ∧ ∃𝑧𝐴 (𝜒𝑤 = 𝐹)) → 𝑥 = 𝑤))
4342adantr 481 . . . . 5 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → ((∃𝑦𝐴 (𝜑𝑥 = 𝐵) ∧ ∃𝑧𝐴 (𝜒𝑤 = 𝐹)) → 𝑥 = 𝑤))
4443alrimivv 1853 . . . 4 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → ∀𝑥𝑤((∃𝑦𝐴 (𝜑𝑥 = 𝐵) ∧ ∃𝑧𝐴 (𝜒𝑤 = 𝐹)) → 𝑥 = 𝑤))
45 eqeq1 2625 . . . . . . . 8 (𝑥 = 𝑤 → (𝑥 = 𝐵𝑤 = 𝐵))
4645anbi2d 739 . . . . . . 7 (𝑥 = 𝑤 → ((𝜑𝑥 = 𝐵) ↔ (𝜑𝑤 = 𝐵)))
4746rexbidv 3045 . . . . . 6 (𝑥 = 𝑤 → (∃𝑦𝐴 (𝜑𝑥 = 𝐵) ↔ ∃𝑦𝐴 (𝜑𝑤 = 𝐵)))
48 unirep.3 . . . . . . . 8 (𝑦 = 𝑧 → (𝜑𝜒))
49 unirep.4 . . . . . . . . 9 (𝑦 = 𝑧𝐵 = 𝐹)
5049eqeq2d 2631 . . . . . . . 8 (𝑦 = 𝑧 → (𝑤 = 𝐵𝑤 = 𝐹))
5148, 50anbi12d 746 . . . . . . 7 (𝑦 = 𝑧 → ((𝜑𝑤 = 𝐵) ↔ (𝜒𝑤 = 𝐹)))
5251cbvrexv 3160 . . . . . 6 (∃𝑦𝐴 (𝜑𝑤 = 𝐵) ↔ ∃𝑧𝐴 (𝜒𝑤 = 𝐹))
5347, 52syl6bb 276 . . . . 5 (𝑥 = 𝑤 → (∃𝑦𝐴 (𝜑𝑥 = 𝐵) ↔ ∃𝑧𝐴 (𝜒𝑤 = 𝐹)))
5453eu4 2517 . . . 4 (∃!𝑥𝑦𝐴 (𝜑𝑥 = 𝐵) ↔ (∃𝑥𝑦𝐴 (𝜑𝑥 = 𝐵) ∧ ∀𝑥𝑤((∃𝑦𝐴 (𝜑𝑥 = 𝐵) ∧ ∃𝑧𝐴 (𝜒𝑤 = 𝐹)) → 𝑥 = 𝑤)))
5523, 44, 54sylanbrc 697 . . 3 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → ∃!𝑥𝑦𝐴 (𝜑𝑥 = 𝐵))
5618iota2 5836 . . 3 ((𝐶 ∈ V ∧ ∃!𝑥𝑦𝐴 (𝜑𝑥 = 𝐵)) → (∃𝑦𝐴 (𝜑𝐶 = 𝐵) ↔ (℩𝑥𝑦𝐴 (𝜑𝑥 = 𝐵)) = 𝐶))
5715, 55, 56syl2anc 692 . 2 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → (∃𝑦𝐴 (𝜑𝐶 = 𝐵) ↔ (℩𝑥𝑦𝐴 (𝜑𝑥 = 𝐵)) = 𝐶))
589, 57mpbid 222 1 ((∀𝑦𝐴𝑧𝐴 ((𝜑𝜒) → 𝐵 = 𝐹) ∧ (𝐷𝐴𝜓)) → (℩𝑥𝑦𝐴 (𝜑𝑥 = 𝐵)) = 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  wal 1478   = wceq 1480  wex 1701  wcel 1987  ∃!weu 2469  wral 2907  wrex 2908  Vcvv 3186  csb 3514  cio 5808
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-nul 4749
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-fal 1486  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-nul 3892  df-sn 4149  df-pr 4151  df-uni 4403  df-iota 5810
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator