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

Theorem ax15 1006
Description: Axiom ax-15 806 is redundant if we assume ax-17 925. Remark 9.6 in [Megill] p. 448 (p. 16 of the preprint), regarding axiom scheme C14'.
Assertion
Ref Expression
ax15 |- (-. A.z z = x -> (-. A.z z = y -> (x e. y -> A.z x e. y)))

Proof of Theorem ax15
StepHypRef Expression
1 hbn1 708 . . . . 5 |- (-. A.z z = y -> A.z -. A.z z = y)
2 ddeel2 1004 . . . . 5 |- (-. A.z z = y -> (w e. y -> A.z w e. y))
31, 2hbim1 781 . . . 4 |- ((-. A.z z = y -> w e. y) -> A.z(-. A.z z = y -> w e. y))
4 a13b 819 . . . . 5 |- (w = x -> (w e. y <-> x e. y))
54imbi2d 464 . . . 4 |- (w = x -> ((-. A.z z = y -> w e. y) <-> (-. A.z z = y -> x e. y)))
63, 5ddelim 1000 . . 3 |- (-. A.z z = x -> ((-. A.z z = y -> x e. y) -> A.z(-. A.z z = y -> x e. y)))
7119.21 738 . . 3 |- (A.z(-. A.z z = y -> x e. y) <-> (-. A.z z = y -> A.z x e. y))
86, 7syl6ib 185 . 2 |- (-. A.z z = x -> ((-. A.z z = y -> x e. y) -> (-. A.z z = y -> A.z x e. y)))
98pm2.86d 65 1 |- (-. A.z z = x -> (-. A.z z = y -> (x e. y -> A.z x e. y)))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2  A.wal 672   = weq 797   e. wel 803
This theorem is referenced by:  axrepnd 3740  axpowndlem4 3746  axregndlem2 3749  axinfndlem1 3751  axinfnd 3752  axacndlem4 3756  axacndlem5 3757  axacnd 3758
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-17 925
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853
metamath.org