ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ax-13 Unicode version

Axiom ax-13 2138
Description: Axiom of left equality for the binary predicate  e.. One of the equality and substitution axioms for a non-logical predicate in our predicate calculus with equality. It substitutes equal variables into the left-hand side of the  e. binary predicate. Axiom scheme C12' in [Megill] p. 448 (p. 16 of the preprint). It is a special case of Axiom B8 (p. 75) of system S2 of [Tarski] p. 77. "Non-logical" means that the predicate is not a primitive of predicate calculus proper but instead is an extension to it. "Binary" means that the predicate has two arguments. In a system of predicate calculus with equality, like ours, equality is not usually considered to be a non-logical predicate. In systems of predicate calculus without equality, it typically would be. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
ax-13  |-  ( x  =  y  ->  (
x  e.  z  -> 
y  e.  z ) )

Detailed syntax breakdown of Axiom ax-13
StepHypRef Expression
1 vx . . 3  setvar  x
2 vy . . 3  setvar  y
31, 2weq 1491 . 2  wff  x  =  y
4 vz . . . 4  setvar  z
51, 4wel 2137 . . 3  wff  x  e.  z
62, 4wel 2137 . . 3  wff  y  e.  z
75, 6wi 4 . 2  wff  ( x  e.  z  ->  y  e.  z )
83, 7wi 4 1  wff  ( x  =  y  ->  (
x  e.  z  -> 
y  e.  z ) )
Colors of variables: wff set class
This axiom is referenced by:  elequ1  2140  el  4157
  Copyright terms: Public domain W3C validator