Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ax11v Unicode version

Theorem ax11v 1990
 Description: This is a version of ax-11o 1940 when the variables are distinct. Axiom (C8) of [Monk2] p. 105. See theorem ax11v2 1935 for the rederivation of ax-11o 1940 from this theorem. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
ax11v
Distinct variable group:   ,
Allowed substitution hints:   (,)

Proof of Theorem ax11v
StepHypRef Expression
1 ax-1 7 . . . 4
2 ax-16 1926 . . . 4
31, 2syl5 30 . . 3
43a1d 24 . 2
5 ax11o 1939 . 2
64, 5pm2.61i 158 1
 Colors of variables: wff set class Syntax hints:   wi 6  wal 1532 This theorem is referenced by:  sb56  1991 This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1926 This theorem depends on definitions:  df-bi 179  df-an 362  df-ex 1538  df-nf 1540
 Copyright terms: Public domain W3C validator