Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-ax9-2 Structured version   Visualization version   GIF version

Theorem bj-ax9-2 32891
Description: Proof of ax-9 1999 from Tarski's FOL=, ax-8 1992 (specifically, ax8v1 1994 and ax8v2 1995) , df-cleq 2615 and ax-ext 2602. For a version not using ax-8 1992, see bj-ax9 32890. This shows that df-cleq 2615 is "too powerful". A possible definition is given by bj-df-cleq 32893. (Contributed by BJ, 24-Jun-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-ax9-2 (𝑥 = 𝑦 → (𝑧𝑥𝑧𝑦))

Proof of Theorem bj-ax9-2
Dummy variables 𝑣 𝑢 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ax-ext 2602 . . . . 5 (∀𝑢(𝑢𝑣𝑢𝑤) → 𝑣 = 𝑤)
21df-cleq 2615 . . . 4 (𝑥 = 𝑦 ↔ ∀𝑢(𝑢𝑥𝑢𝑦))
32biimpi 206 . . 3 (𝑥 = 𝑦 → ∀𝑢(𝑢𝑥𝑢𝑦))
4 biimp 205 . . 3 ((𝑢𝑥𝑢𝑦) → (𝑢𝑥𝑢𝑦))
53, 4sylg 1750 . 2 (𝑥 = 𝑦 → ∀𝑢(𝑢𝑥𝑢𝑦))
6 ax8v2 1995 . . . . 5 (𝑧 = 𝑢 → (𝑧𝑥𝑢𝑥))
76equcoms 1947 . . . 4 (𝑢 = 𝑧 → (𝑧𝑥𝑢𝑥))
8 ax8v1 1994 . . . 4 (𝑢 = 𝑧 → (𝑢𝑦𝑧𝑦))
97, 8imim12d 81 . . 3 (𝑢 = 𝑧 → ((𝑢𝑥𝑢𝑦) → (𝑧𝑥𝑧𝑦)))
109spimvw 1927 . 2 (∀𝑢(𝑢𝑥𝑢𝑦) → (𝑧𝑥𝑧𝑦))
115, 10syl 17 1 (𝑥 = 𝑦 → (𝑧𝑥𝑧𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wal 1481
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705  df-cleq 2615
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator