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

Theorem reuun2 3364
Description: Transfer uniqueness to a smaller or larger class. (Contributed by NM, 21-Oct-2005.)
Assertion
Ref Expression
reuun2 (¬ ∃𝑥𝐵 𝜑 → (∃!𝑥 ∈ (𝐴𝐵)𝜑 ↔ ∃!𝑥𝐴 𝜑))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reuun2
StepHypRef Expression
1 df-rex 2423 . . 3 (∃𝑥𝐵 𝜑 ↔ ∃𝑥(𝑥𝐵𝜑))
2 euor2 2058 . . 3 (¬ ∃𝑥(𝑥𝐵𝜑) → (∃!𝑥((𝑥𝐵𝜑) ∨ (𝑥𝐴𝜑)) ↔ ∃!𝑥(𝑥𝐴𝜑)))
31, 2sylnbi 668 . 2 (¬ ∃𝑥𝐵 𝜑 → (∃!𝑥((𝑥𝐵𝜑) ∨ (𝑥𝐴𝜑)) ↔ ∃!𝑥(𝑥𝐴𝜑)))
4 df-reu 2424 . . 3 (∃!𝑥 ∈ (𝐴𝐵)𝜑 ↔ ∃!𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝜑))
5 elun 3222 . . . . . 6 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
65anbi1i 454 . . . . 5 ((𝑥 ∈ (𝐴𝐵) ∧ 𝜑) ↔ ((𝑥𝐴𝑥𝐵) ∧ 𝜑))
7 andir 809 . . . . . 6 (((𝑥𝐴𝑥𝐵) ∧ 𝜑) ↔ ((𝑥𝐴𝜑) ∨ (𝑥𝐵𝜑)))
8 orcom 718 . . . . . 6 (((𝑥𝐴𝜑) ∨ (𝑥𝐵𝜑)) ↔ ((𝑥𝐵𝜑) ∨ (𝑥𝐴𝜑)))
97, 8bitri 183 . . . . 5 (((𝑥𝐴𝑥𝐵) ∧ 𝜑) ↔ ((𝑥𝐵𝜑) ∨ (𝑥𝐴𝜑)))
106, 9bitri 183 . . . 4 ((𝑥 ∈ (𝐴𝐵) ∧ 𝜑) ↔ ((𝑥𝐵𝜑) ∨ (𝑥𝐴𝜑)))
1110eubii 2009 . . 3 (∃!𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝜑) ↔ ∃!𝑥((𝑥𝐵𝜑) ∨ (𝑥𝐴𝜑)))
124, 11bitri 183 . 2 (∃!𝑥 ∈ (𝐴𝐵)𝜑 ↔ ∃!𝑥((𝑥𝐵𝜑) ∨ (𝑥𝐴𝜑)))
13 df-reu 2424 . 2 (∃!𝑥𝐴 𝜑 ↔ ∃!𝑥(𝑥𝐴𝜑))
143, 12, 133bitr4g 222 1 (¬ ∃𝑥𝐵 𝜑 → (∃!𝑥 ∈ (𝐴𝐵)𝜑 ↔ ∃!𝑥𝐴 𝜑))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  wo 698  wex 1469  wcel 1481  ∃!weu 2000  wrex 2418  ∃!wreu 2419  cun 3074
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-rex 2423  df-reu 2424  df-v 2691  df-un 3080
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator