Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ax12v2-o Structured version   Visualization version   GIF version

Theorem ax12v2-o 40100
Description: Rederivation of ax-c15 40040 from ax12v 2213 (without using ax-c15 40040 or the full ax-12 2212). Thus, the hypothesis (ax12v 2213) provides an alternate axiom that can be used in place of ax-c15 40040. See also axc15 2451. (Contributed by NM, 2-Feb-2007.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
ax12v2-o.1 (𝑥 = 𝑧 → (𝜑 → ∀𝑥(𝑥 = 𝑧 → 𝜑)))
Assertion
Ref Expression
ax12v2-o (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))))
Distinct variable groups:   𝑥,𝑧   𝑦,𝑧   𝜑,𝑧
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem ax12v2-o
StepHypRef Expression
1 ax6ev 2001 . 2 ∃𝑧 𝑧 = 𝑦
2 ax12v2-o.1 . . . . 5 (𝑥 = 𝑧 → (𝜑 → ∀𝑥(𝑥 = 𝑧 → 𝜑)))
3 equequ2 2058 . . . . . . 7 (𝑧 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑥 = 𝑦))
43adantl 487 . . . . . 6 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → (𝑥 = 𝑧 ↔ 𝑥 = 𝑦))
5 dveeq2-o 40084 . . . . . . . . 9 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦))
65imp 412 . . . . . . . 8 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → ∀𝑥 𝑧 = 𝑦)
7 nfa1-o 40066 . . . . . . . . 9 Ⅎ𝑥∀𝑥 𝑧 = 𝑦
83imbi1d 344 . . . . . . . . . 10 (𝑧 = 𝑦 → ((𝑥 = 𝑧 → 𝜑) ↔ (𝑥 = 𝑦 → 𝜑)))
98sps-o 40059 . . . . . . . . 9 (∀𝑥 𝑧 = 𝑦 → ((𝑥 = 𝑧 → 𝜑) ↔ (𝑥 = 𝑦 → 𝜑)))
107, 9albid 2258 . . . . . . . 8 (∀𝑥 𝑧 = 𝑦 → (∀𝑥(𝑥 = 𝑧 → 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)))
116, 10syl 18 . . . . . . 7 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → (∀𝑥(𝑥 = 𝑧 → 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)))
1211imbi2d 343 . . . . . 6 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → ((𝜑 → ∀𝑥(𝑥 = 𝑧 → 𝜑)) ↔ (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))))
134, 12imbi12d 347 . . . . 5 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → ((𝑥 = 𝑧 → (𝜑 → ∀𝑥(𝑥 = 𝑧 → 𝜑))) ↔ (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))))
142, 13mpbii 236 . . . 4 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑧 = 𝑦) → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))))
1514ex 418 . . 3 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))))
1615exlimdv 1965 . 2 (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑧 𝑧 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))))
171, 16mpi 21 1 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567  ∃wex 1811
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-11 2193  ax-12 2212  ax-13 2401  ax-c5 40034  ax-c4 40035  ax-c7 40036  ax-c10 40037  ax-c11 40038  ax-c9 40041
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816
This theorem is used by:  ax12a2-o  40101
  Copyright terms: Public domain W3C validator