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

Axiom ax-8 1447
 Description: Axiom of Equality. One of the equality and substitution axioms of predicate calculus with equality. This is similar to, but not quite, a transitive law for equality (proved later as equtr 1649). Axiom scheme C8' in [Megill] p. 448 (p. 16 of the preprint). Also appears as Axiom C7 of [Monk2] p. 105. Axioms ax-8 1447 through ax-16 1749 are the axioms having to do with equality, substitution, and logical properties of our binary predicate ∈ (which later in set theory will mean "is a member of"). Note that all axioms except ax-16 1749 and ax-17 1471 are still valid even when 𝑥, 𝑦, and 𝑧 are replaced with the same variable because they do not have any distinct variable (Metamath's \$d) restrictions. Distinct variable restrictions are required for ax-16 1749 and ax-17 1471 only. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
ax-8 (𝑥 = 𝑦 → (𝑥 = 𝑧𝑦 = 𝑧))

Detailed syntax breakdown of Axiom ax-8
StepHypRef Expression
1 vx . . 3 setvar 𝑥
2 vy . . 3 setvar 𝑦
31, 2weq 1444 . 2 wff 𝑥 = 𝑦
4 vz . . . 4 setvar 𝑧
51, 4weq 1444 . . 3 wff 𝑥 = 𝑧
62, 4weq 1444 . . 3 wff 𝑦 = 𝑧
75, 6wi 4 . 2 wff (𝑥 = 𝑧𝑦 = 𝑧)
83, 7wi 4 1 wff (𝑥 = 𝑦 → (𝑥 = 𝑧𝑦 = 𝑧))
 Colors of variables: wff set class This axiom is referenced by:  hbequid  1458  equidqe  1477  equid  1641  equcomi  1644  equtr  1649  equequ1  1652  equvini  1695  equveli  1696  aev  1747  ax16i  1793  mo23  1996
 Copyright terms: Public domain W3C validator