Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ax-c15 Structured version   Visualization version   Unicode version

Axiom ax-c15 32525
Description: Axiom ax-c15 32525 was the original version of ax-12 1950, before it was discovered (in Jan. 2007) that the shorter ax-12 1950 could replace it. It appears as Axiom scheme C15' in [Megill] p. 448 (p. 16 of the preprint). It is based on Lemma 16 of [Tarski] p. 70 and Axiom C8 of [Monk2] p. 105, from which it can be proved by cases. To understand this theorem more easily, think of " -.  A. x x  =  y  ->..." as informally meaning "if  x and  y are distinct variables then..." The antecedent becomes false if the same variable is substituted for  x and  y, ensuring the theorem is sound whenever this is the case. In some later theorems, we call an antecedent of the form  -.  A. x x  =  y a "distinctor."

Interestingly, if the wff expression substituted for  ph contains no wff variables, the resulting statement can be proved without invoking this axiom. This means that even though this axiom is metalogically independent from the others, it is not logically independent. Specifically, we can prove any wff-variable-free instance of axiom ax-c15 32525 (from which the ax-12 1950 instance follows by theorem ax12 2190.) The proof is by induction on formula length, using ax12eq 32576 and ax12el 32577 for the basis steps and ax12indn 32578, ax12indi 32579, and ax12inda 32583 for the induction steps. (This paragraph is true provided we use ax-c11 32523 in place of ax-c11n 32524.)

This axiom is obsolete and should no longer be used. It is proved above as theorem axc15 2153, which should be used instead. (Contributed by NM, 14-May-1993.) (New usage is discouraged.)

Assertion
Ref Expression
ax-c15  |-  ( -. 
A. x  x  =  y  ->  ( x  =  y  ->  ( ph  ->  A. x ( x  =  y  ->  ph )
) ) )

Detailed syntax breakdown of Axiom ax-c15
StepHypRef Expression
1 vx . . . . 5  setvar  x
2 vy . . . . 5  setvar  y
31, 2weq 1799 . . . 4  wff  x  =  y
43, 1wal 1450 . . 3  wff  A. x  x  =  y
54wn 3 . 2  wff  -.  A. x  x  =  y
6 wph . . . 4  wff  ph
73, 6wi 4 . . . . 5  wff  ( x  =  y  ->  ph )
87, 1wal 1450 . . . 4  wff  A. x
( x  =  y  ->  ph )
96, 8wi 4 . . 3  wff  ( ph  ->  A. x ( x  =  y  ->  ph )
)
103, 9wi 4 . 2  wff  ( x  =  y  ->  ( ph  ->  A. x ( x  =  y  ->  ph )
) )
115, 10wi 4 1  wff  ( -. 
A. x  x  =  y  ->  ( x  =  y  ->  ( ph  ->  A. x ( x  =  y  ->  ph )
) ) )
Colors of variables: wff setvar class
This axiom is referenced by:  ax12o  32539
  Copyright terms: Public domain W3C validator