HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem reuun1 2872
Description: Transfer uniqueness to a smaller class.
Assertion
Ref Expression
reuun1 |- ((E.x e. A ph /\ E!x e. (A u. B)(ph \/ ps)) -> E!x e. A ph)
Distinct variable groups:   x,A   x,B

Proof of Theorem reuun1
StepHypRef Expression
1 ssun1 2767 . 2 |- A C_ (A u. B)
2 orc 291 . . . 4 |- (ph -> (ph \/ ps))
32a1i 8 . . 3 |- (x e. A -> (ph -> (ph \/ ps)))
43rgen 2159 . 2 |- A.x e. A (ph -> (ph \/ ps))
5 reuss2 2870 . 2 |- (((A C_ (A u. B) /\ A.x e. A (ph -> (ph \/ ps))) /\ (E.x e. A ph /\ E!x e. (A u. B)(ph \/ ps))) -> E!x e. A ph)
61, 4, 5mpanl12 773 1 |- ((E.x e. A ph /\ E!x e. (A u. B)(ph \/ ps)) -> E!x e. A ph)
Colors of variables: wff set class
Syntax hints:   -> wi 3   \/ wo 239   /\ wa 240   e. wcel 1300  A.wral 2105  E.wrex 2106  E!wreu 2107   u. cun 2591   C_ wss 2593
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ral 2109  df-rex 2110  df-reu 2111  df-v 2294  df-un 2600  df-in 2603  df-ss 2605
Copyright terms: Public domain