| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nllyeq | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the Locally 𝐴 predicate. (Contributed by Mario Carneiro, 2-Mar-2015.) |
| Ref | Expression |
|---|---|
| nllyeq | ⊢ (𝐴 = 𝐵 → 𝑛-Locally 𝐴 = 𝑛-Locally 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq2 2823 | . . . . 5 ⊢ (𝐴 = 𝐵 → ((𝑗 ↾t 𝑢) ∈ 𝐴 ↔ (𝑗 ↾t 𝑢) ∈ 𝐵)) | |
| 2 | 1 | rexbidv 3164 | . . . 4 ⊢ (𝐴 = 𝐵 → (∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐴 ↔ ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐵)) |
| 3 | 2 | 2ralbidv 3205 | . . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐴 ↔ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐵)) |
| 4 | 3 | rabbidv 3423 | . 2 ⊢ (𝐴 = 𝐵 → {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐴} = {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐵}) |
| 5 | df-nlly 23405 | . 2 ⊢ 𝑛-Locally 𝐴 = {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐴} | |
| 6 | df-nlly 23405 | . 2 ⊢ 𝑛-Locally 𝐵 = {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐵} | |
| 7 | 4, 5, 6 | 3eqtr4g 2795 | 1 ⊢ (𝐴 = 𝐵 → 𝑛-Locally 𝐴 = 𝑛-Locally 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2108 ∀wral 3051 ∃wrex 3060 {crab 3415 ∩ cin 3925 𝒫 cpw 4575 {csn 4601 ‘cfv 6531 (class class class)co 7405 ↾t crest 17434 Topctop 22831 neicnei 23035 𝑛-Locally cnlly 23403 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-ral 3052 df-rex 3061 df-rab 3416 df-nlly 23405 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |