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

Theorem reuss 3440
Description: Transfer uniqueness to a smaller subclass. (Contributed by NM, 21-Aug-1999.)
Assertion
Ref Expression
reuss ((𝐴𝐵 ∧ ∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑) → ∃!𝑥𝐴 𝜑)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reuss
StepHypRef Expression
1 idd 21 . . . 4 (𝑥𝐴 → (𝜑𝜑))
21rgen 2547 . . 3 𝑥𝐴 (𝜑𝜑)
3 reuss2 3439 . . 3 (((𝐴𝐵 ∧ ∀𝑥𝐴 (𝜑𝜑)) ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑)) → ∃!𝑥𝐴 𝜑)
42, 3mpanl2 435 . 2 ((𝐴𝐵 ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑)) → ∃!𝑥𝐴 𝜑)
543impb 1201 1 ((𝐴𝐵 ∧ ∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑) → ∃!𝑥𝐴 𝜑)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980  wcel 2164  wral 2472  wrex 2473  ∃!wreu 2474  wss 3153
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-3an 982  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-ral 2477  df-rex 2478  df-reu 2479  df-in 3159  df-ss 3166
This theorem is referenced by:  riotass  5901
  Copyright terms: Public domain W3C validator