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

Theorem ax11f 1358
Description: Basis step for constructing a substitution instance of ax-11o 1213 without using ax-11o 1213. We can start with any formula ph in which x is not free.
Hypothesis
Ref Expression
ax11f.1 |- (ph -> A.xph)
Assertion
Ref Expression
ax11f |- (-. A.x x = y -> (x = y -> (ph -> A.x(x = y -> ph))))

Proof of Theorem ax11f
StepHypRef Expression
1 ax11f.1 . . . 4 |- (ph -> A.xph)
2 ax-1 4 . . . 4 |- (ph -> (x = y -> ph))
31, 219.21ai 995 . . 3 |- (ph -> A.x(x = y -> ph))
43a1i 8 . 2 |- (x = y -> (ph -> A.x(x = y -> ph)))
54a1i 8 1 |- (-. A.x x = y -> (x = y -> (ph -> A.x(x = y -> ph))))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3  A.wal 951   = wceq 953
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-mp 7  ax-gen 960  ax-4 970  ax-5o 972
Copyright terms: Public domain