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

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

Proof of Theorem reu7
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 reu3 3715 . 2 (∃!𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 ∧ ∃𝑧𝐴𝑥𝐴 (𝜑𝑥 = 𝑧)))
2 rmo4.1 . . . . . . 7 (𝑥 = 𝑦 → (𝜑𝜓))
3 equequ1 2023 . . . . . . . 8 (𝑥 = 𝑦 → (𝑥 = 𝑧𝑦 = 𝑧))
4 equcom 2016 . . . . . . . 8 (𝑦 = 𝑧𝑧 = 𝑦)
53, 4syl6bb 288 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 = 𝑧𝑧 = 𝑦))
62, 5imbi12d 346 . . . . . 6 (𝑥 = 𝑦 → ((𝜑𝑥 = 𝑧) ↔ (𝜓𝑧 = 𝑦)))
76cbvralvw 3447 . . . . 5 (∀𝑥𝐴 (𝜑𝑥 = 𝑧) ↔ ∀𝑦𝐴 (𝜓𝑧 = 𝑦))
87rexbii 3244 . . . 4 (∃𝑧𝐴𝑥𝐴 (𝜑𝑥 = 𝑧) ↔ ∃𝑧𝐴𝑦𝐴 (𝜓𝑧 = 𝑦))
9 equequ1 2023 . . . . . . 7 (𝑧 = 𝑥 → (𝑧 = 𝑦𝑥 = 𝑦))
109imbi2d 342 . . . . . 6 (𝑧 = 𝑥 → ((𝜓𝑧 = 𝑦) ↔ (𝜓𝑥 = 𝑦)))
1110ralbidv 3194 . . . . 5 (𝑧 = 𝑥 → (∀𝑦𝐴 (𝜓𝑧 = 𝑦) ↔ ∀𝑦𝐴 (𝜓𝑥 = 𝑦)))
1211cbvrexvw 3448 . . . 4 (∃𝑧𝐴𝑦𝐴 (𝜓𝑧 = 𝑦) ↔ ∃𝑥𝐴𝑦𝐴 (𝜓𝑥 = 𝑦))
138, 12bitri 276 . . 3 (∃𝑧𝐴𝑥𝐴 (𝜑𝑥 = 𝑧) ↔ ∃𝑥𝐴𝑦𝐴 (𝜓𝑥 = 𝑦))
1413anbi2i 622 . 2 ((∃𝑥𝐴 𝜑 ∧ ∃𝑧𝐴𝑥𝐴 (𝜑𝑥 = 𝑧)) ↔ (∃𝑥𝐴 𝜑 ∧ ∃𝑥𝐴𝑦𝐴 (𝜓𝑥 = 𝑦)))
151, 14bitri 276 1 (∃!𝑥𝐴 𝜑 ↔ (∃𝑥𝐴 𝜑 ∧ ∃𝑥𝐴𝑦𝐴 (𝜓𝑥 = 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wral 3135  wrex 3136  ∃!wreu 3137
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-10 2136  ax-12 2167
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clel 2890  df-ral 3140  df-rex 3141  df-reu 3142  df-rmo 3143
This theorem is referenced by:  cshwrepswhash1  16424
  Copyright terms: Public domain W3C validator