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

Theorem mobid 2517
 Description: Formula-building rule for "at most one" quantifier (deduction rule). (Contributed by NM, 8-Mar-1995.)
Hypotheses
Ref Expression
mobid.1 𝑥𝜑
mobid.2 (𝜑 → (𝜓𝜒))
Assertion
Ref Expression
mobid (𝜑 → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒))

Proof of Theorem mobid
StepHypRef Expression
1 mobid.1 . . . 4 𝑥𝜑
2 mobid.2 . . . 4 (𝜑 → (𝜓𝜒))
31, 2exbid 2129 . . 3 (𝜑 → (∃𝑥𝜓 ↔ ∃𝑥𝜒))
41, 2eubid 2516 . . 3 (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥𝜒))
53, 4imbi12d 333 . 2 (𝜑 → ((∃𝑥𝜓 → ∃!𝑥𝜓) ↔ (∃𝑥𝜒 → ∃!𝑥𝜒)))
6 df-mo 2503 . 2 (∃*𝑥𝜓 ↔ (∃𝑥𝜓 → ∃!𝑥𝜓))
7 df-mo 2503 . 2 (∃*𝑥𝜒 ↔ (∃𝑥𝜒 → ∃!𝑥𝜒))
85, 6, 73bitr4g 303 1 (𝜑 → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196  ∃wex 1744  Ⅎwnf 1748  ∃!weu 2498  ∃*wmo 2499 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-12 2087 This theorem depends on definitions:  df-bi 197  df-ex 1745  df-nf 1750  df-eu 2502  df-mo 2503 This theorem is referenced by:  mobidv  2519  moanim  2558  rmobida  3159  rmoeq1f  3167  funcnvmptOLD  29595  funcnvmpt  29596
 Copyright terms: Public domain W3C validator