![]() |
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 2960 | . . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵 |
4 | eleq2 2871 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
5 | 4 | imbi1d 343 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑥 ∈ 𝐵 → 𝜑))) |
6 | 3, 5 | albid 2189 | . 2 ⊢ (𝐴 = 𝐵 → (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝜑))) |
7 | df-ral 3110 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
8 | df-ral 3110 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝜑)) | |
9 | 6, 7, 8 | 3bitr4g 315 | 1 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐵 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∀wal 1520 = wceq 1522 ∈ wcel 2081 Ⅎwnfc 2933 ∀wral 3105 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1777 ax-4 1791 ax-5 1888 ax-6 1947 ax-7 1992 ax-8 2083 ax-9 2091 ax-10 2112 ax-11 2126 ax-12 2141 ax-ext 2769 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-tru 1525 df-ex 1762 df-nf 1766 df-cleq 2788 df-clel 2863 df-nfc 2935 df-ral 3110 |
This theorem is referenced by: raleqOLD 3369 raleqbid 3381 dfon2lem3 32638 indexa 34540 ralbi12f 34970 iineq12f 34974 ac6s6f 34983 raleqd 40944 stoweidlem28 41855 stoweidlem52 41879 fourierdlem31 41965 fourierdlem68 42001 fourierdlem103 42036 fourierdlem104 42037 |
Copyright terms: Public domain | W3C validator |