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

Theorem sbcel1 1466
Description: Class substitution into a membership relation.
Assertion
Ref Expression
sbcel1 |- (A e. C -> ([A / x]x e. B <-> A e. B))
Distinct variable group(s):   x,A   x,B

Proof of Theorem sbcel1
StepHypRef Expression
1 elisset 1354 . 2 |- (A e. C -> A e. V)
2 elex 1356 . . 3 |- (A e. V -> E.x x = A)
3 ax-17 925 . . . . . . 7 |- (y e. A -> A.x y e. A)
43hbsbc 1446 . . . . . 6 |- ((A e. V -> [A / x]x e. B) -> A.x(A e. V -> [A / x]x e. B))
5 ax-17 925 . . . . . 6 |- ((A e. V -> A e. B) -> A.x(A e. V -> A e. B))
64, 5hbbi 705 . . . . 5 |- (((A e. V -> [A / x]x e. B) <-> (A e. V -> A e. B)) -> A.x((A e. V -> [A / x]x e. B) <-> (A e. V -> A e. B)))
7 sbceq1 1443 . . . . . . 7 |- (x = A -> (x e. B <-> [A / x]x e. B))
8 eleq1 1149 . . . . . . 7 |- (x = A -> (x e. B <-> A e. B))
97, 8bitr3d 408 . . . . . 6 |- (x = A -> ([A / x]x e. B <-> A e. B))
109imbi2d 464 . . . . 5 |- (x = A -> ((A e. V -> [A / x]x e. B) <-> (A e. V -> A e. B)))
116, 1019.23ai 746 . . . 4 |- (E.x x = A -> ((A e. V -> [A / x]x e. B) <-> (A e. V -> A e. B)))
1211pm5.74rd 446 . . 3 |- (E.x x = A -> (A e. V -> ([A / x]x e. B <-> A e. B)))
132, 12mpcom 49 . 2 |- (A e. V -> ([A / x]x e. B <-> A e. B))
141, 13syl 12 1 |- (A e. C -> ([A / x]x e. B <-> A e. B))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127  E.wex 678   = wceq 1091   e. wcel 1092  Vcvv 1348  [wsbc 1440
This theorem is referenced by:  rax4 1471  tfinds2 2405
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-sbc 1441
metamath.org