Theorem raleqf 3343

Description: Equality theorem for restricted universal quantifier, with bound-variable hypotheses instead of distinct variable restrictions. See raleq 3318 for a version based on fewer axioms. (Contributed by NM, 7-Mar-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)

Hypotheses

Ref	Expression
raleqf.1	⊢ Ⅎ𝑥𝐴
raleqf.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
raleqf	⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 𝜑))

Proof of Theorem raleqf

Step	Hyp	Ref	Expression
1		raleqf.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2		raleqf.2	. . . 4 ⊢ Ⅎ𝑥𝐵
3	1, 2	nfeq 2937	. . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵
4		eleq2 2851	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
5	4	imbi1d 344	. . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑥 ∈ 𝐵 → 𝜑)))
6	3, 5	albid 2260	. 2 ⊢ (𝐴 = 𝐵 → (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝜑)))
7		df-ral 3079	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
8		df-ral 3079	. 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝜑))
9	6, 7, 8	3bitr4g 317	1 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 𝜑))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2909  ∀wral 3078

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079

This theorem is used by:  rexeqf  3344  raleqbid  3345  dfon2lem3  36347  indexa  38468  ralbi12f  38893  iineq12f  38897  ac6s6f  38906  raleqd  45954  stoweidlem28  46841  stoweidlem52  46865  fourierdlem31  46951  fourierdlem68  46987  fourierdlem103  47022  fourierdlem104  47023