Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > raleqf | Structured version Visualization version GIF version |
Description: Equality theorem for restricted universal quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.) (Revised by Andrew Salmon, 11-Jul-2011.) |
Ref | Expression |
---|---|
raleq1f.1 | ⊢ Ⅎ𝑥𝐴 |
raleq1f.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
raleqf | ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | raleq1f.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
2 | raleq1f.2 | . . . 4 ⊢ Ⅎ𝑥𝐵 | |
3 | 1, 2 | nfeq 2910 | . . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵 |
4 | eleq2 2819 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
5 | 4 | imbi1d 345 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑥 ∈ 𝐵 → 𝜑))) |
6 | 3, 5 | albid 2222 | . 2 ⊢ (𝐴 = 𝐵 → (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝜑))) |
7 | df-ral 3056 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
8 | df-ral 3056 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝜑)) | |
9 | 6, 7, 8 | 3bitr4g 317 | 1 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∀wal 1541 = wceq 1543 ∈ wcel 2112 Ⅎwnfc 2877 ∀wral 3051 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-tru 1546 df-ex 1788 df-nf 1792 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ral 3056 |
This theorem is referenced by: raleqbid 3319 dfon2lem3 33431 indexa 35577 ralbi12f 36004 iineq12f 36008 ac6s6f 36017 raleqd 42300 stoweidlem28 43187 stoweidlem52 43211 fourierdlem31 43297 fourierdlem68 43333 fourierdlem103 43368 fourierdlem104 43369 |
Copyright terms: Public domain | W3C validator |