Theorem ax12inda 39579

Description: Induction step for constructing a substitution instance of ax-c15 39520 without using ax-c15 39520. Quantification case. (When 𝑧 and 𝑦 are distinct, ax12inda2 39578 may be used instead to avoid the dummy variable 𝑤 in the proof.) (Contributed by NM, 24-Jan-2007.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
ax12inda.1	⊢ (¬ ∀𝑥 𝑥 = 𝑤 → (𝑥 = 𝑤 → (𝜑 → ∀𝑥(𝑥 = 𝑤 → 𝜑))))

Assertion

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

Distinct variable groups:   𝜑,𝑤   𝑥,𝑤   𝑦,𝑤   𝑧,𝑤

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

Proof of Theorem ax12inda

Step	Hyp	Ref	Expression
1		ax6ev 1992	. . 3 ⊢ ∃𝑤 𝑤 = 𝑦
2		ax12inda.1	. . . . . . 7 ⊢ (¬ ∀𝑥 𝑥 = 𝑤 → (𝑥 = 𝑤 → (𝜑 → ∀𝑥(𝑥 = 𝑤 → 𝜑))))
3	2	ax12inda2 39578	. . . . . 6 ⊢ (¬ ∀𝑥 𝑥 = 𝑤 → (𝑥 = 𝑤 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑤 → ∀𝑧𝜑))))
4		dveeq2-o 39564	. . . . . . . . 9 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑤 = 𝑦 → ∀𝑥 𝑤 = 𝑦))
5	4	imp 411	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) → ∀𝑥 𝑤 = 𝑦)
6		hba1-o 39528	. . . . . . . . . 10 ⊢ (∀𝑥 𝑤 = 𝑦 → ∀𝑥∀𝑥 𝑤 = 𝑦)
7		equequ2 2049	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑦 → (𝑥 = 𝑤 ↔ 𝑥 = 𝑦))
8	7	sps-o 39539	. . . . . . . . . 10 ⊢ (∀𝑥 𝑤 = 𝑦 → (𝑥 = 𝑤 ↔ 𝑥 = 𝑦))
9	6, 8	albidh 1889	. . . . . . . . 9 ⊢ (∀𝑥 𝑤 = 𝑦 → (∀𝑥 𝑥 = 𝑤 ↔ ∀𝑥 𝑥 = 𝑦))
10	9	notbid 321	. . . . . . . 8 ⊢ (∀𝑥 𝑤 = 𝑦 → (¬ ∀𝑥 𝑥 = 𝑤 ↔ ¬ ∀𝑥 𝑥 = 𝑦))
11	5, 10	syl 18	. . . . . . 7 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) → (¬ ∀𝑥 𝑥 = 𝑤 ↔ ¬ ∀𝑥 𝑥 = 𝑦))
12	7	adantl 486	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) → (𝑥 = 𝑤 ↔ 𝑥 = 𝑦))
13	8	imbi1d 344	. . . . . . . . . . 11 ⊢ (∀𝑥 𝑤 = 𝑦 → ((𝑥 = 𝑤 → ∀𝑧𝜑) ↔ (𝑥 = 𝑦 → ∀𝑧𝜑)))
14	6, 13	albidh 1889	. . . . . . . . . 10 ⊢ (∀𝑥 𝑤 = 𝑦 → (∀𝑥(𝑥 = 𝑤 → ∀𝑧𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑)))
15	5, 14	syl 18	. . . . . . . . 9 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) → (∀𝑥(𝑥 = 𝑤 → ∀𝑧𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑)))
16	15	imbi2d 343	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) → ((∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑤 → ∀𝑧𝜑)) ↔ (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑))))
17	12, 16	imbi12d 347	. . . . . . 7 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) → ((𝑥 = 𝑤 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑤 → ∀𝑧𝜑))) ↔ (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑)))))
18	11, 17	imbi12d 347	. . . . . 6 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) → ((¬ ∀𝑥 𝑥 = 𝑤 → (𝑥 = 𝑤 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑤 → ∀𝑧𝜑)))) ↔ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑))))))
19	3, 18	mpbii 236	. . . . 5 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) → (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑)))))
20	19	ex 417	. . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑤 = 𝑦 → (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑))))))
21	20	exlimdv 1956	. . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑤 𝑤 = 𝑦 → (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑))))))
22	1, 21	mpi 21	. 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑)))))
23	22	pm2.43i 53	1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (∀𝑧𝜑 → ∀𝑥(𝑥 = 𝑦 → ∀𝑧𝜑))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1561  ∃wex 1802

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-10 2178  ax-11 2194  ax-12 2215  ax-13 2406  ax-c5 39514  ax-c4 39515  ax-c7 39516  ax-c10 39517  ax-c11 39518  ax-c9 39521  ax-c16 39523

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1566  df-ex 1803  df-nf 1807

This theorem is referenced by: (None)