Theorem ralidm 4413

Description: Idempotent law for restricted quantifier. (Contributed by NM, 28-Mar-1997.)

Assertion

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

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem ralidm

Step	Hyp	Ref	Expression
1		rzal 4411	. . 3 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑)
2		rzal 4411	. . 3 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 𝜑)
3	1, 2	2thd 268	. 2 ⊢ (𝐴 = ∅ → (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))
4		neq0 4259	. . 3 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)
5		df-ral 3111	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑))
6		nfra1 3183	. . . . . 6 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝜑
7	6	19.23 2209	. . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑) ↔ (∃𝑥 𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑))
8	5, 7	bitri 278	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑))
9		biimt 364	. . . 4 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑)))
10	8, 9	bitr4id 293	. . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))
11	4, 10	sylbi 220	. 2 ⊢ (¬ 𝐴 = ∅ → (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))
12	3, 11	pm2.61i 185	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209  ∀wal 1536   = wceq 1538  ∃wex 1781   ∈ wcel 2111  ∀wral 3106  ∅c0 4243

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ne 2988  df-ral 3111  df-dif 3884  df-nul 4244

This theorem is referenced by:  cnvpo  6106  dfwe2  7476