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

Theorem reuun1 3486
Description: Transfer uniqueness to a smaller class. (Contributed by NM, 21-Oct-2005.)
Assertion
Ref Expression
reuun1 ((∃𝑥𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴𝐵)(𝜑𝜓)) → ∃!𝑥𝐴 𝜑)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem reuun1
StepHypRef Expression
1 ssun1 3367 . 2 𝐴 ⊆ (𝐴𝐵)
2 orc 717 . . 3 (𝜑 → (𝜑𝜓))
32rgenw 2585 . 2 𝑥𝐴 (𝜑 → (𝜑𝜓))
4 reuss2 3484 . 2 (((𝐴 ⊆ (𝐴𝐵) ∧ ∀𝑥𝐴 (𝜑 → (𝜑𝜓))) ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴𝐵)(𝜑𝜓))) → ∃!𝑥𝐴 𝜑)
51, 3, 4mpanl12 436 1 ((∃𝑥𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴𝐵)(𝜑𝜓)) → ∃!𝑥𝐴 𝜑)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 713  wral 2508  wrex 2509  ∃!wreu 2510  cun 3195  wss 3197
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-v 2801  df-un 3201  df-in 3203  df-ss 3210
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator