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

Theorem reuhyp 2905
Description: A theorem useful for eliminating the restricted existential uniqueness hypotheses in reuxfr 2904.
Hypotheses
Ref Expression
reuhyp.1 |- (x e. C -> B e. C)
reuhyp.2 |- ((x e. C /\ y e. C) -> (x = A <-> y = B))
Assertion
Ref Expression
reuhyp |- (x e. C -> E!y e. C x = A)
Distinct variable groups:   y,B   y,C   x,y

Proof of Theorem reuhyp
StepHypRef Expression
1 reuhyp.1 . . . . 5 |- (x e. C -> B e. C)
2 elisset 1817 . . . . 5 |- (B e. C -> B e. V)
31, 2syl 10 . . . 4 |- (x e. C -> B e. V)
4 eueq 1916 . . . 4 |- (B e. V <-> E!y y = B)
53, 4sylib 198 . . 3 |- (x e. C -> E!y y = B)
6 eleq1 1534 . . . . . . 7 |- (y = B -> (y e. C <-> B e. C))
76, 1syl5cbir 211 . . . . . 6 |- (x e. C -> (y = B -> y e. C))
87pm4.71rd 639 . . . . 5 |- (x e. C -> (y = B <-> (y e. C /\ y = B)))
9 reuhyp.2 . . . . . 6 |- ((x e. C /\ y e. C) -> (x = A <-> y = B))
109pm5.32da 649 . . . . 5 |- (x e. C -> ((y e. C /\ x = A) <-> (y e. C /\ y = B)))
118, 10bitr4d 531 . . . 4 |- (x e. C -> (y = B <-> (y e. C /\ x = A)))
1211eubidv 1386 . . 3 |- (x e. C -> (E!y y = B <-> E!y(y e. C /\ x = A)))
135, 12mpbid 195 . 2 |- (x e. C -> E!y(y e. C /\ x = A))
14 df-reu 1651 . 2 |- (E!y e. C x = A <-> E!y(y e. C /\ x = A))
1513, 14sylibr 200 1 |- (x e. C -> E!y e. C x = A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956   e. wcel 958  E!weu 1380  E!wreu 1647  Vcvv 1811
This theorem is referenced by:  reuunineg 6066  zmax 6220  rebtwnz 6222
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-reu 1651  df-v 1812
Copyright terms: Public domain