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

Theorem reupick 2282
Description: Restricted uniqueness "picks" a member of a subclass.
Assertion
Ref Expression
reupick |- (((A (_ B /\ (E.x e. A ph /\ E!x e. B ph)) /\ ph) -> (x e. A <-> x e. B))
Distinct variable groups:   x,A   x,B

Proof of Theorem reupick
StepHypRef Expression
1 ssel 2066 . . 3 |- (A (_ B -> (x e. A -> x e. B))
21ad2antrr 406 . 2 |- (((A (_ B /\ (E.x e. A ph /\ E!x e. B ph)) /\ ph) -> (x e. A -> x e. B))
31ancrd 299 . . . . . . . . . . . 12 |- (A (_ B -> (x e. A -> (x e. B /\ x e. A)))
43anim1d 562 . . . . . . . . . . 11 |- (A (_ B -> ((x e. A /\ ph) -> ((x e. B /\ x e. A) /\ ph)))
5 an23 487 . . . . . . . . . . 11 |- (((x e. B /\ x e. A) /\ ph) <-> ((x e. B /\ ph) /\ x e. A))
64, 5syl6ib 212 . . . . . . . . . 10 |- (A (_ B -> ((x e. A /\ ph) -> ((x e. B /\ ph) /\ x e. A)))
7619.22dv 1292 . . . . . . . . 9 |- (A (_ B -> (E.x(x e. A /\ ph) -> E.x((x e. B /\ ph) /\ x e. A)))
8 eupick 1436 . . . . . . . . . 10 |- ((E!x(x e. B /\ ph) /\ E.x((x e. B /\ ph) /\ x e. A)) -> ((x e. B /\ ph) -> x e. A))
98ex 373 . . . . . . . . 9 |- (E!x(x e. B /\ ph) -> (E.x((x e. B /\ ph) /\ x e. A) -> ((x e. B /\ ph) -> x e. A)))
107, 9syl9 57 . . . . . . . 8 |- (A (_ B -> (E!x(x e. B /\ ph) -> (E.x(x e. A /\ ph) -> ((x e. B /\ ph) -> x e. A))))
1110com23 32 . . . . . . 7 |- (A (_ B -> (E.x(x e. A /\ ph) -> (E!x(x e. B /\ ph) -> ((x e. B /\ ph) -> x e. A))))
1211imp32 363 . . . . . 6 |- ((A (_ B /\ (E.x(x e. A /\ ph) /\ E!x(x e. B /\ ph))) -> ((x e. B /\ ph) -> x e. A))
13 df-rex 1653 . . . . . . 7 |- (E.x e. A ph <-> E.x(x e. A /\ ph))
14 df-reu 1654 . . . . . . 7 |- (E!x e. B ph <-> E!x(x e. B /\ ph))
1513, 14anbi12i 484 . . . . . 6 |- ((E.x e. A ph /\ E!x e. B ph) <-> (E.x(x e. A /\ ph) /\ E!x(x e. B /\ ph)))
1612, 15sylan2b 454 . . . . 5 |- ((A (_ B /\ (E.x e. A ph /\ E!x e. B ph)) -> ((x e. B /\ ph) -> x e. A))
1716exp3a 376 . . . 4 |- ((A (_ B /\ (E.x e. A ph /\ E!x e. B ph)) -> (x e. B -> (ph -> x e. A)))
1817com23 32 . . 3 |- ((A (_ B /\ (E.x e. A ph /\ E!x e. B ph)) -> (ph -> (x e. B -> x e. A)))
1918imp 350 . 2 |- (((A (_ B /\ (E.x e. A ph /\ E!x e. B ph)) /\ ph) -> (x e. B -> x e. A))
202, 19impbid 518 1 |- (((A (_ B /\ (E.x e. A ph /\ E!x e. B ph)) /\ ph) -> (x e. A <-> x e. B))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   e. wcel 960  E.wex 982  E!weu 1382  E.wrex 1649  E!wreu 1650   (_ wss 2050
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-rex 1653  df-reu 1654  df-in 2054  df-ss 2056
Copyright terms: Public domain