Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  eubid GIF version

Theorem eubid 1907
 Description: Formula-building rule for uniqueness quantifier (deduction rule). (Contributed by NM, 9-Jul-1994.)
Hypotheses
Ref Expression
eubid.1 𝑥𝜑
eubid.2 (𝜑 → (𝜓𝜒))
Assertion
Ref Expression
eubid (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥𝜒))

Proof of Theorem eubid
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eubid.1 . . . 4 𝑥𝜑
2 eubid.2 . . . . 5 (𝜑 → (𝜓𝜒))
32bibi1d 222 . . . 4 (𝜑 → ((𝜓𝑥 = 𝑦) ↔ (𝜒𝑥 = 𝑦)))
41, 3albid 1506 . . 3 (𝜑 → (∀𝑥(𝜓𝑥 = 𝑦) ↔ ∀𝑥(𝜒𝑥 = 𝑦)))
54exbidv 1706 . 2 (𝜑 → (∃𝑦𝑥(𝜓𝑥 = 𝑦) ↔ ∃𝑦𝑥(𝜒𝑥 = 𝑦)))
6 df-eu 1903 . 2 (∃!𝑥𝜓 ↔ ∃𝑦𝑥(𝜓𝑥 = 𝑦))
7 df-eu 1903 . 2 (∃!𝑥𝜒 ↔ ∃𝑦𝑥(𝜒𝑥 = 𝑦))
85, 6, 73bitr4g 212 1 (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥𝜒))
 Colors of variables: wff set class Syntax hints:   → wi 4   ↔ wb 98  ∀wal 1241  Ⅎwnf 1349  ∃wex 1381  ∃!weu 1900 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-17 1419  ax-ial 1427 This theorem depends on definitions:  df-bi 110  df-nf 1350  df-eu 1903 This theorem is referenced by:  eubidv  1908  mobid  1935  reubida  2491  reueq1f  2503  eusv2i  4187
 Copyright terms: Public domain W3C validator