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

Theorem reuun1 3246
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 3135 . 2 𝐴 ⊆ (𝐴𝐵)
2 orc 665 . . 3 (𝜑 → (𝜑𝜓))
32rgenw 2418 . 2 𝑥𝐴 (𝜑 → (𝜑𝜓))
4 reuss2 3244 . 2 (((𝐴 ⊆ (𝐴𝐵) ∧ ∀𝑥𝐴 (𝜑 → (𝜑𝜓))) ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴𝐵)(𝜑𝜓))) → ∃!𝑥𝐴 𝜑)
51, 3, 4mpanl12 426 1 ((∃𝑥𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴𝐵)(𝜑𝜓)) → ∃!𝑥𝐴 𝜑)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wo 661  wral 2348  wrex 2349  ∃!wreu 2350  cun 2971  wss 2973
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-reu 2355  df-v 2603  df-un 2977  df-in 2979  df-ss 2986
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator