Theorem alcomimw 2075

Description: Weak version of ax-11 2193. See alcomw 2077 for the biconditional form. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 10-Apr-2017.) (Proof shortened by Wolf Lammen, 28-Dec-2023.)

Hypothesis

Ref	Expression
alcomimw.1	⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
alcomimw	⊢ (∀𝑥∀𝑦𝜑 → ∀𝑦∀𝑥𝜑)

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

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

Proof of Theorem alcomimw

Step	Hyp	Ref	Expression
1		alcomimw.1	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓))
2	1	cbvalvw 2068	. . . 4 ⊢ (∀𝑦𝜑 ↔ ∀𝑧𝜓)
3	2	biimpi 219	. . 3 ⊢ (∀𝑦𝜑 → ∀𝑧𝜓)
4	3	alimi 1843	. 2 ⊢ (∀𝑥∀𝑦𝜑 → ∀𝑥∀𝑧𝜓)
5		ax-5 1942	. 2 ⊢ (∀𝑥∀𝑧𝜓 → ∀𝑦∀𝑥∀𝑧𝜓)
6	1	biimprd 251	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝜓 → 𝜑))
7	6	equcoms 2052	. . . 4 ⊢ (𝑧 = 𝑦 → (𝜓 → 𝜑))
8	7	spimvw 2018	. . 3 ⊢ (∀𝑧𝜓 → 𝜑)
9	8	2alimi 1844	. 2 ⊢ (∀𝑦∀𝑥∀𝑧𝜓 → ∀𝑦∀𝑥𝜑)
10	4, 5, 9	3syl 19	1 ⊢ (∀𝑥∀𝑦𝜑 → ∀𝑦∀𝑥𝜑)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567

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

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812

This theorem is used by:  excomimw  2076  alcomw  2077  hbalw  2083  ax11w  2166  bj-ssblem2  37647