MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  euind Structured version   Visualization version   GIF version

Theorem euind 3545
Description: Existential uniqueness via an indirect equality. (Contributed by NM, 11-Oct-2010.)
Hypotheses
Ref Expression
euind.1 𝐵 ∈ V
euind.2 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
euind ((∀𝑥𝑦((𝜑𝜓) → 𝐴 = 𝐵) ∧ ∃𝑥𝜑) → ∃!𝑧𝑥(𝜑𝑧 = 𝐴))
Distinct variable groups:   𝑦,𝑧,𝜑   𝑥,𝑧,𝜓   𝑦,𝐴,𝑧   𝑥,𝐵,𝑧   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem euind
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 euind.2 . . . . . 6 (𝑥 = 𝑦 → (𝜑𝜓))
21cbvexvw 2126 . . . . 5 (∃𝑥𝜑 ↔ ∃𝑦𝜓)
3 euind.1 . . . . . . . . 9 𝐵 ∈ V
43isseti 3361 . . . . . . . 8 𝑧 𝑧 = 𝐵
54biantrur 520 . . . . . . 7 (𝜓 ↔ (∃𝑧 𝑧 = 𝐵𝜓))
65exbii 1924 . . . . . 6 (∃𝑦𝜓 ↔ ∃𝑦(∃𝑧 𝑧 = 𝐵𝜓))
7 19.41v 2029 . . . . . . 7 (∃𝑧(𝑧 = 𝐵𝜓) ↔ (∃𝑧 𝑧 = 𝐵𝜓))
87exbii 1924 . . . . . 6 (∃𝑦𝑧(𝑧 = 𝐵𝜓) ↔ ∃𝑦(∃𝑧 𝑧 = 𝐵𝜓))
9 excom 2198 . . . . . 6 (∃𝑦𝑧(𝑧 = 𝐵𝜓) ↔ ∃𝑧𝑦(𝑧 = 𝐵𝜓))
106, 8, 93bitr2i 288 . . . . 5 (∃𝑦𝜓 ↔ ∃𝑧𝑦(𝑧 = 𝐵𝜓))
112, 10bitri 264 . . . 4 (∃𝑥𝜑 ↔ ∃𝑧𝑦(𝑧 = 𝐵𝜓))
12 eqeq2 2782 . . . . . . . . 9 (𝐴 = 𝐵 → (𝑧 = 𝐴𝑧 = 𝐵))
1312imim2i 16 . . . . . . . 8 (((𝜑𝜓) → 𝐴 = 𝐵) → ((𝜑𝜓) → (𝑧 = 𝐴𝑧 = 𝐵)))
14 biimpr 210 . . . . . . . . . 10 ((𝑧 = 𝐴𝑧 = 𝐵) → (𝑧 = 𝐵𝑧 = 𝐴))
1514imim2i 16 . . . . . . . . 9 (((𝜑𝜓) → (𝑧 = 𝐴𝑧 = 𝐵)) → ((𝜑𝜓) → (𝑧 = 𝐵𝑧 = 𝐴)))
16 an31 627 . . . . . . . . . . 11 (((𝜑𝜓) ∧ 𝑧 = 𝐵) ↔ ((𝑧 = 𝐵𝜓) ∧ 𝜑))
1716imbi1i 338 . . . . . . . . . 10 ((((𝜑𝜓) ∧ 𝑧 = 𝐵) → 𝑧 = 𝐴) ↔ (((𝑧 = 𝐵𝜓) ∧ 𝜑) → 𝑧 = 𝐴))
18 impexp 437 . . . . . . . . . 10 ((((𝜑𝜓) ∧ 𝑧 = 𝐵) → 𝑧 = 𝐴) ↔ ((𝜑𝜓) → (𝑧 = 𝐵𝑧 = 𝐴)))
19 impexp 437 . . . . . . . . . 10 ((((𝑧 = 𝐵𝜓) ∧ 𝜑) → 𝑧 = 𝐴) ↔ ((𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)))
2017, 18, 193bitr3i 290 . . . . . . . . 9 (((𝜑𝜓) → (𝑧 = 𝐵𝑧 = 𝐴)) ↔ ((𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)))
2115, 20sylib 208 . . . . . . . 8 (((𝜑𝜓) → (𝑧 = 𝐴𝑧 = 𝐵)) → ((𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)))
2213, 21syl 17 . . . . . . 7 (((𝜑𝜓) → 𝐴 = 𝐵) → ((𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)))
23222alimi 1888 . . . . . 6 (∀𝑥𝑦((𝜑𝜓) → 𝐴 = 𝐵) → ∀𝑥𝑦((𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)))
24 19.23v 2023 . . . . . . . 8 (∀𝑦((𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)) ↔ (∃𝑦(𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)))
2524albii 1895 . . . . . . 7 (∀𝑥𝑦((𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)) ↔ ∀𝑥(∃𝑦(𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)))
26 19.21v 2020 . . . . . . 7 (∀𝑥(∃𝑦(𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)) ↔ (∃𝑦(𝑧 = 𝐵𝜓) → ∀𝑥(𝜑𝑧 = 𝐴)))
2725, 26bitri 264 . . . . . 6 (∀𝑥𝑦((𝑧 = 𝐵𝜓) → (𝜑𝑧 = 𝐴)) ↔ (∃𝑦(𝑧 = 𝐵𝜓) → ∀𝑥(𝜑𝑧 = 𝐴)))
2823, 27sylib 208 . . . . 5 (∀𝑥𝑦((𝜑𝜓) → 𝐴 = 𝐵) → (∃𝑦(𝑧 = 𝐵𝜓) → ∀𝑥(𝜑𝑧 = 𝐴)))
2928eximdv 1998 . . . 4 (∀𝑥𝑦((𝜑𝜓) → 𝐴 = 𝐵) → (∃𝑧𝑦(𝑧 = 𝐵𝜓) → ∃𝑧𝑥(𝜑𝑧 = 𝐴)))
3011, 29syl5bi 232 . . 3 (∀𝑥𝑦((𝜑𝜓) → 𝐴 = 𝐵) → (∃𝑥𝜑 → ∃𝑧𝑥(𝜑𝑧 = 𝐴)))
3130imp 393 . 2 ((∀𝑥𝑦((𝜑𝜓) → 𝐴 = 𝐵) ∧ ∃𝑥𝜑) → ∃𝑧𝑥(𝜑𝑧 = 𝐴))
32 pm4.24 553 . . . . . . . . 9 (𝜑 ↔ (𝜑𝜑))
3332biimpi 206 . . . . . . . 8 (𝜑 → (𝜑𝜑))
34 prth 810 . . . . . . . 8 (((𝜑𝑧 = 𝐴) ∧ (𝜑𝑤 = 𝐴)) → ((𝜑𝜑) → (𝑧 = 𝐴𝑤 = 𝐴)))
35 eqtr3 2792 . . . . . . . 8 ((𝑧 = 𝐴𝑤 = 𝐴) → 𝑧 = 𝑤)
3633, 34, 35syl56 36 . . . . . . 7 (((𝜑𝑧 = 𝐴) ∧ (𝜑𝑤 = 𝐴)) → (𝜑𝑧 = 𝑤))
3736alanimi 1892 . . . . . 6 ((∀𝑥(𝜑𝑧 = 𝐴) ∧ ∀𝑥(𝜑𝑤 = 𝐴)) → ∀𝑥(𝜑𝑧 = 𝑤))
38 19.23v 2023 . . . . . 6 (∀𝑥(𝜑𝑧 = 𝑤) ↔ (∃𝑥𝜑𝑧 = 𝑤))
3937, 38sylib 208 . . . . 5 ((∀𝑥(𝜑𝑧 = 𝐴) ∧ ∀𝑥(𝜑𝑤 = 𝐴)) → (∃𝑥𝜑𝑧 = 𝑤))
4039com12 32 . . . 4 (∃𝑥𝜑 → ((∀𝑥(𝜑𝑧 = 𝐴) ∧ ∀𝑥(𝜑𝑤 = 𝐴)) → 𝑧 = 𝑤))
4140alrimivv 2008 . . 3 (∃𝑥𝜑 → ∀𝑧𝑤((∀𝑥(𝜑𝑧 = 𝐴) ∧ ∀𝑥(𝜑𝑤 = 𝐴)) → 𝑧 = 𝑤))
4241adantl 467 . 2 ((∀𝑥𝑦((𝜑𝜓) → 𝐴 = 𝐵) ∧ ∃𝑥𝜑) → ∀𝑧𝑤((∀𝑥(𝜑𝑧 = 𝐴) ∧ ∀𝑥(𝜑𝑤 = 𝐴)) → 𝑧 = 𝑤))
43 eqeq1 2775 . . . . 5 (𝑧 = 𝑤 → (𝑧 = 𝐴𝑤 = 𝐴))
4443imbi2d 329 . . . 4 (𝑧 = 𝑤 → ((𝜑𝑧 = 𝐴) ↔ (𝜑𝑤 = 𝐴)))
4544albidv 2001 . . 3 (𝑧 = 𝑤 → (∀𝑥(𝜑𝑧 = 𝐴) ↔ ∀𝑥(𝜑𝑤 = 𝐴)))
4645eu4 2667 . 2 (∃!𝑧𝑥(𝜑𝑧 = 𝐴) ↔ (∃𝑧𝑥(𝜑𝑧 = 𝐴) ∧ ∀𝑧𝑤((∀𝑥(𝜑𝑧 = 𝐴) ∧ ∀𝑥(𝜑𝑤 = 𝐴)) → 𝑧 = 𝑤)))
4731, 42, 46sylanbrc 572 1 ((∀𝑥𝑦((𝜑𝜓) → 𝐴 = 𝐵) ∧ ∃𝑥𝜑) → ∃!𝑧𝑥(𝜑𝑧 = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382  wal 1629   = wceq 1631  wex 1852  wcel 2145  ∃!weu 2618  Vcvv 3351
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-v 3353
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator