Theorem ax12inda2 39446

Description: Induction step for constructing a substitution instance of ax-c15 39388 without using ax-c15 39388. Quantification case. When 𝑧 and 𝑦 are distinct, this theorem avoids the dummy variables needed by the more general ax12inda 39447. (Contributed by NM, 24-Jan-2007.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
ax12inda2.1	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))))

Assertion

Ref	Expression
ax12inda2	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑))))

Distinct variable group:   𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem ax12inda2

Step	Hyp	Ref	Expression
1		ax-1 6	. . . . 5 ⊢ (∀𝑧𝜑 → (𝑥 = 𝑦 → ∀𝑧𝜑))
2		axc16g-o 39433	. . . . 5 ⊢ (∀𝑦 𝑦 = 𝑧 → ((𝑥 = 𝑦 → ∀𝑧𝜑) → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑)))
3	1, 2	syl5 34	. . . 4 ⊢ (∀𝑦 𝑦 = 𝑧 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑)))
4	3	a1d 25	. . 3 ⊢ (∀𝑦 𝑦 = 𝑧 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑))))
5	4	a1d 25	. 2 ⊢ (∀𝑦 𝑦 = 𝑧 → (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑)))))
6		ax12inda2.1	. . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))))
7	6	ax12indalem 39444	. 2 ⊢ (¬ ∀𝑦 𝑦 = 𝑧 → (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑)))))
8	5, 7	pm2.61i 183	1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑))))

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1545

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-10 2152  ax-11 2168  ax-12 2189  ax-13 2380  ax-c5 39382  ax-c4 39383  ax-c7 39384  ax-c10 39385  ax-c11 39386  ax-c9 39389  ax-c16 39391

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-nf 1791

This theorem is referenced by:  ax12inda  39447