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

Theorem ax11a 926
Description: This is a version of ax-11 801 when the variables are distinct. Axiom (C8) of [Monk2] p. 105.
Assertion
Ref Expression
ax11a |- (x = y -> (ph -> A.x(x = y -> ph)))
Distinct variable group(s):   x,y

Proof of Theorem ax11a
StepHypRef Expression
1 ax-16 922 . . . 4 |- (A.x x = y -> ((x = y -> ph) -> A.x(x = y -> ph)))
2 ax-1 3 . . . 4 |- (ph -> (x = y -> ph))
31, 2syl5 22 . . 3 |- (A.x x = y -> (ph -> A.x(x = y -> ph)))
43a1d 14 . 2 |- (A.x x = y -> (x = y -> (ph -> A.x(x = y -> ph))))
5 ax-11 801 . 2 |- (-. A.x x = y -> (x = y -> (ph -> A.x(x = y -> ph))))
64, 5pm2.61i 110 1 |- (x = y -> (ph -> A.x(x = y -> ph)))
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672   = weq 797
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-11 801  ax-16 922
metamath.org