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

Theorem elrabsf 1960
Description: Membership in a restricted class abstraction, expressed with explicit class substitution. (The variation elrabf 1901 has implicit substitution). The hypothesis specifies that x must not be a free variable in B.
Hypothesis
Ref Expression
elrabsf.1 |- (y e. B -> A.x y e. B)
Assertion
Ref Expression
elrabsf |- (A e. {x e. B | ph} <-> (A e. B /\ [A / x]ph))
Distinct variable groups:   y,B   x,y

Proof of Theorem elrabsf
StepHypRef Expression
1 elrabsf.1 . . . 4 |- (y e. B -> A.x y e. B)
2 ax-17 970 . . . 4 |- (y e. B -> A.z y e. B)
3 ax-17 970 . . . 4 |- (ph -> A.zph)
4 hbs1 1331 . . . 4 |- ([z / x]ph -> A.x[z / x]ph)
5 sbequ12 1180 . . . 4 |- (x = z -> (ph <-> [z / x]ph))
61, 2, 3, 4, 5cbvrab 1907 . . 3 |- {x e. B | ph} = {z e. B | [z / x]ph}
76eleq2i 1536 . 2 |- (A e. {x e. B | ph} <-> A e. {z e. B | [z / x]ph})
8 ax-17 970 . . . 4 |- (w e. A -> A.z w e. A)
9 ax-17 970 . . . 4 |- (w e. B -> A.z w e. B)
108hbsbc1 1946 . . . 4 |- ((A e. V -> [A / z][z / x]ph) -> A.z(A e. V -> [A / z][z / x]ph))
11 sbceq1a 1941 . . . . 5 |- (z = A -> ([z / x]ph <-> [A / z][z / x]ph))
12 19.8a 1028 . . . . . . 7 |- (z = A -> E.z z = A)
13 isset 1811 . . . . . . 7 |- (A e. V <-> E.z z = A)
1412, 13sylibr 200 . . . . . 6 |- (z = A -> A e. V)
15 biimt 730 . . . . . 6 |- (A e. V -> ([A / z][z / x]ph <-> (A e. V -> [A / z][z / x]ph)))
1614, 15syl 10 . . . . 5 |- (z = A -> ([A / z][z / x]ph <-> (A e. V -> [A / z][z / x]ph)))
1711, 16bitrd 527 . . . 4 |- (z = A -> ([z / x]ph <-> (A e. V -> [A / z][z / x]ph)))
188, 9, 10, 17elrabf 1901 . . 3 |- (A e. {z e. B | [z / x]ph} <-> (A e. B /\ (A e. V -> [A / z][z / x]ph)))
19 elisset 1814 . . . . 5 |- (A e. B -> A e. V)
2019, 15syl 10 . . . 4 |- (A e. B -> ([A / z][z / x]ph <-> (A e. V -> [A / z][z / x]ph)))
2120pm5.32i 644 . . 3 |- ((A e. B /\ [A / z][z / x]ph) <-> (A e. B /\ (A e. V -> [A / z][z / x]ph)))
2218, 21bitr4 176 . 2 |- (A e. {z e. B | [z / x]ph} <-> (A e. B /\ [A / z][z / x]ph))
23 sbccog 1949 . . 3 |- (A e. B -> ([A / z][z / x]ph <-> [A / x]ph))
2423pm5.32i 644 . 2 |- ((A e. B /\ [A / z][z / x]ph) <-> (A e. B /\ [A / x]ph))
257, 22, 243bitr 177 1 |- (A e. {x e. B | ph} <-> (A e. B /\ [A / x]ph))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 953   = wceq 955   e. wcel 957  E.wex 979  [wsbc 1169  {crab 1646  Vcvv 1808
This theorem is referenced by:  elabs2 1961  iunrab 2592  reucl2 2884  onminesb 3006  tfis 3123
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-9 964  ax-10 965  ax-11 966  ax-12 967  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 980  df-sb 1171  df-clab 1463  df-cleq 1468  df-clel 1471  df-rab 1650  df-v 1809  df-sbc 1939
Copyright terms: Public domain