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

Theorem hbsbc1 1956
Description: Bound-variable hypothesis builder for class substitution. (The antecedent ensures that A is a set, which is necessary if we restrict ourselves to using only the "weak" class substitution definition dfsbcq 1950.)
Hypothesis
Ref Expression
hbsbc1g.1 |- (y e. A -> A.x y e. A)
Assertion
Ref Expression
hbsbc1 |- ((A e. B -> [A / x]ph) -> A.x(A e. B -> [A / x]ph))
Distinct variable groups:   x,y   y,A   x,B,y

Proof of Theorem hbsbc1
StepHypRef Expression
1 hbsbc1g.1 . . 3 |- (y e. A -> A.x y e. A)
2 ax-17 975 . . 3 |- (y e. B -> A.x y e. B)
31, 2hbel 1573 . 2 |- (A e. B -> A.x A e. B)
41hbsbc1g 1955 . 2 |- (A e. B -> ([A / x]ph -> A.x[A / x]ph))
53, 4hbim1 1109 1 |- ((A e. B -> [A / x]ph) -> A.x(A e. B -> [A / x]ph))
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 958   e. wcel 962  [wsbc 1176
This theorem is referenced by:  hbsbc1v 1957  sbc5g 1961  sbc6g 1962  elrabsf 1971  sbcel1gv 1988  sbcel2gv 1989  reuuni4 2901  nn1suc 5945
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 966  ax-gen 967  ax-10 970  ax-12 972  ax-17 975  ax-4 977  ax-5o 979  ax-6o 982  ax-9o 1129  ax-10o 1146  ax-16 1216  ax-11o 1224  ax-ext 1466
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 985  df-sb 1178  df-clab 1471  df-cleq 1476  df-clel 1479  df-v 1819  df-sbc 1949
Copyright terms: Public domain