MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  reuun1 Structured version   Visualization version   GIF version

Theorem reuun1 4275
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 4178 . 2 𝐴 ⊆ (𝐴 ∪ 𝐵)
2 orc 881 . . 3 (𝜑 → (𝜑 ∨ 𝜓))
32rgenw 3083 . 2 ∀𝑥 ∈ 𝐴 (𝜑 → (𝜑 ∨ 𝜓))
4 reuss2 4273 . 2 (((𝐴 ⊆ (𝐴 ∪ 𝐵) ∧ ∀𝑥 ∈ 𝐴 (𝜑 → (𝜑 ∨ 𝜓))) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴 ∪ 𝐵)(𝜑 ∨ 𝜓))) → ∃!𝑥 ∈ 𝐴 𝜑)
51, 3, 4mpanl12 715 1 ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ (𝐴 ∪ 𝐵)(𝜑 ∨ 𝜓)) → ∃!𝑥 ∈ 𝐴 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861  ∀wral 3079  ∃wrex 3089  ∃!wreu 3366   ⊆ wss 3899   ∪ cun 4151
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-reu 3369  df-v 3455  df-ss 3900  df-un 4153
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator