Theorem dfsb3 1221

Description: An alternate definition of proper substitution df-sb 1168 that uses only primitive connectives (no defined terms) on the right-hand side.

Assertion

Ref	Expression
dfsb3	|- ([y / x]ph <-> ((x = y -> -. ph) -> A.x(x = y -> ph)))

Proof of Theorem dfsb3

Step	Hyp	Ref	Expression
1		df-or 224	. 2 |- (((x = y /\ ph) \/ A.x(x = y -> ph)) <-> (-. (x = y /\ ph) -> A.x(x = y -> ph)))
2		dfsb2 1220	. 2 |- ([y / x]ph <-> ((x = y /\ ph) \/ A.x(x = y -> ph)))
3		imnan 242	. . 3 |- ((x = y -> -. ph) <-> -. (x = y /\ ph))
4	3	imbi1i 186	. 2 |- (((x = y -> -. ph) -> A.x(x = y -> ph)) <-> (-. (x = y /\ ph) -> A.x(x = y -> ph)))
5	1, 2, 4	3bitr4 183	1 |- ([y / x]ph <-> ((x = y -> -. ph) -> A.x(x = y -> ph)))

Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   \/ wo 222   /\ wa 223  A.wal 951   = wceq 953  [wsbc 1166

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-10 963  ax-12 965  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-11o 1213

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168

Copyright terms: Public domain