Theorem ralidmw 4474

Description: Idempotent law for restricted quantifier. Weak version of ralidm 4475, which does not require ax-10 2179, ax-12 2215, but requires ax-8 2148. (Contributed by GG, 30-Sep-2024.)

Hypothesis

Ref	Expression
ralidmw.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
ralidmw	⊢ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑)

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

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

Proof of Theorem ralidmw

Step	Hyp	Ref	Expression
1		df-ral 3080	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
2	1	imbi2i 339	. . . 4 ⊢ ((𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑) ↔ (𝑥 ∈ 𝐴 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)))
3	2	albii 1851	. . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)))
4		pm2.21 124	. . . . . 6 ⊢ (¬ 𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐴 → 𝜑))
5		eleq1w 2846	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
6		ralidmw.1	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
7	5, 6	imbi12d 347	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑦 ∈ 𝐴 → 𝜓)))
8	7	spw 2068	. . . . . 6 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) → (𝑥 ∈ 𝐴 → 𝜑))
9	4, 8	ja 188	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) → (𝑥 ∈ 𝐴 → 𝜑))
10	9	alimi 1843	. . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
11	7	hba1w 2083	. . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) → ∀𝑥∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
12		ax-1 6	. . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) → (𝑥 ∈ 𝐴 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)))
13	11, 12	alrimih 1856	. . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) → ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)))
14	10, 13	impbii 212	. . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
15	3, 14	bitri 278	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
16		df-ral 3080	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑))
17	15, 16, 1	3bitr4i 306	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567   ∈ wcel 2146  ∀wral 3079

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 1944  ax-6 2001  ax-7 2042  ax-8 2148

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-clel 2838  df-ral 3080

This theorem is used by:  dfwe2  7795