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

Theorem reu8 3675
 Description: Restricted uniqueness using implicit substitution. (Contributed by NM, 24-Oct-2006.)
Hypothesis
Ref Expression
rmo4.1 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
reu8 (∃!𝑥𝐴 𝜑 ↔ ∃𝑥𝐴 (𝜑 ∧ ∀𝑦𝐴 (𝜓𝑥 = 𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑦   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem reu8
StepHypRef Expression
1 rmo4.1 . . 3 (𝑥 = 𝑦 → (𝜑𝜓))
21cbvreuvw 3401 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑦𝐴 𝜓)
3 reu6 3668 . 2 (∃!𝑦𝐴 𝜓 ↔ ∃𝑥𝐴𝑦𝐴 (𝜓𝑦 = 𝑥))
4 dfbi2 478 . . . . 5 ((𝜓𝑦 = 𝑥) ↔ ((𝜓𝑦 = 𝑥) ∧ (𝑦 = 𝑥𝜓)))
54ralbii 3136 . . . 4 (∀𝑦𝐴 (𝜓𝑦 = 𝑥) ↔ ∀𝑦𝐴 ((𝜓𝑦 = 𝑥) ∧ (𝑦 = 𝑥𝜓)))
6 ancom 464 . . . . . 6 ((𝜑 ∧ ∀𝑦𝐴 (𝜓𝑥 = 𝑦)) ↔ (∀𝑦𝐴 (𝜓𝑥 = 𝑦) ∧ 𝜑))
7 equcom 2025 . . . . . . . . . 10 (𝑥 = 𝑦𝑦 = 𝑥)
87imbi2i 339 . . . . . . . . 9 ((𝜓𝑥 = 𝑦) ↔ (𝜓𝑦 = 𝑥))
98ralbii 3136 . . . . . . . 8 (∀𝑦𝐴 (𝜓𝑥 = 𝑦) ↔ ∀𝑦𝐴 (𝜓𝑦 = 𝑥))
109a1i 11 . . . . . . 7 (𝑥𝐴 → (∀𝑦𝐴 (𝜓𝑥 = 𝑦) ↔ ∀𝑦𝐴 (𝜓𝑦 = 𝑥)))
11 biimt 364 . . . . . . . 8 (𝑥𝐴 → (𝜑 ↔ (𝑥𝐴𝜑)))
12 df-ral 3114 . . . . . . . . 9 (∀𝑦𝐴 (𝑦 = 𝑥𝜓) ↔ ∀𝑦(𝑦𝐴 → (𝑦 = 𝑥𝜓)))
13 bi2.04 392 . . . . . . . . . 10 ((𝑦𝐴 → (𝑦 = 𝑥𝜓)) ↔ (𝑦 = 𝑥 → (𝑦𝐴𝜓)))
1413albii 1821 . . . . . . . . 9 (∀𝑦(𝑦𝐴 → (𝑦 = 𝑥𝜓)) ↔ ∀𝑦(𝑦 = 𝑥 → (𝑦𝐴𝜓)))
15 eleq1w 2875 . . . . . . . . . . . . 13 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
1615, 1imbi12d 348 . . . . . . . . . . . 12 (𝑥 = 𝑦 → ((𝑥𝐴𝜑) ↔ (𝑦𝐴𝜓)))
1716bicomd 226 . . . . . . . . . . 11 (𝑥 = 𝑦 → ((𝑦𝐴𝜓) ↔ (𝑥𝐴𝜑)))
1817equcoms 2027 . . . . . . . . . 10 (𝑦 = 𝑥 → ((𝑦𝐴𝜓) ↔ (𝑥𝐴𝜑)))
1918equsalvw 2010 . . . . . . . . 9 (∀𝑦(𝑦 = 𝑥 → (𝑦𝐴𝜓)) ↔ (𝑥𝐴𝜑))
2012, 14, 193bitrri 301 . . . . . . . 8 ((𝑥𝐴𝜑) ↔ ∀𝑦𝐴 (𝑦 = 𝑥𝜓))
2111, 20syl6bb 290 . . . . . . 7 (𝑥𝐴 → (𝜑 ↔ ∀𝑦𝐴 (𝑦 = 𝑥𝜓)))
2210, 21anbi12d 633 . . . . . 6 (𝑥𝐴 → ((∀𝑦𝐴 (𝜓𝑥 = 𝑦) ∧ 𝜑) ↔ (∀𝑦𝐴 (𝜓𝑦 = 𝑥) ∧ ∀𝑦𝐴 (𝑦 = 𝑥𝜓))))
236, 22syl5bb 286 . . . . 5 (𝑥𝐴 → ((𝜑 ∧ ∀𝑦𝐴 (𝜓𝑥 = 𝑦)) ↔ (∀𝑦𝐴 (𝜓𝑦 = 𝑥) ∧ ∀𝑦𝐴 (𝑦 = 𝑥𝜓))))
24 r19.26 3140 . . . . 5 (∀𝑦𝐴 ((𝜓𝑦 = 𝑥) ∧ (𝑦 = 𝑥𝜓)) ↔ (∀𝑦𝐴 (𝜓𝑦 = 𝑥) ∧ ∀𝑦𝐴 (𝑦 = 𝑥𝜓)))
2523, 24syl6rbbr 293 . . . 4 (𝑥𝐴 → (∀𝑦𝐴 ((𝜓𝑦 = 𝑥) ∧ (𝑦 = 𝑥𝜓)) ↔ (𝜑 ∧ ∀𝑦𝐴 (𝜓𝑥 = 𝑦))))
265, 25syl5bb 286 . . 3 (𝑥𝐴 → (∀𝑦𝐴 (𝜓𝑦 = 𝑥) ↔ (𝜑 ∧ ∀𝑦𝐴 (𝜓𝑥 = 𝑦))))
2726rexbiia 3212 . 2 (∃𝑥𝐴𝑦𝐴 (𝜓𝑦 = 𝑥) ↔ ∃𝑥𝐴 (𝜑 ∧ ∀𝑦𝐴 (𝜓𝑥 = 𝑦)))
282, 3, 273bitri 300 1 (∃!𝑥𝐴 𝜑 ↔ ∃𝑥𝐴 (𝜑 ∧ ∀𝑦𝐴 (𝜓𝑥 = 𝑦)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536   ∈ wcel 2112  ∀wral 3109  ∃wrex 3110  ∃!wreu 3111 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-10 2143  ax-11 2159  ax-12 2176 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clel 2873  df-ral 3114  df-rex 3115  df-reu 3116 This theorem is referenced by:  reu8nf  3809  updjud  9351  reusq0  14817  reumodprminv  16134  grpinveu  18133  addsq2reu  26027  2sqreulem1  26033  2sqreunnlem1  26036  grpoideu  28295  grpoinveu  28305  cvmlift3lem2  32675  euoreqb  43652  2reu8i  43656  2reuimp0  43657  paireqne  44015  itsclquadeu  45178
 Copyright terms: Public domain W3C validator