Theorem nllyeq 23790

Description: Equality theorem for the Locally 𝐴 predicate. (Contributed by Mario Carneiro, 2-Mar-2015.)

Assertion

Ref	Expression
nllyeq	⊢ (𝐴 = 𝐵 → 𝑛-Locally 𝐴 = 𝑛-Locally 𝐵)

Proof of Theorem nllyeq

Dummy variables 𝑗 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq2 2850	. . . . 5 ⊢ (𝐴 = 𝐵 → ((𝑗 ↾t 𝑢) ∈ 𝐴 ↔ (𝑗 ↾t 𝑢) ∈ 𝐵))
2	1	rexbidv 3187	. . . 4 ⊢ (𝐴 = 𝐵 → (∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐴 ↔ ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐵))
3	2	2ralbidv 3227	. . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐴 ↔ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐵))
4	3	rabbidv 3420	. 2 ⊢ (𝐴 = 𝐵 → {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐴} = {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐵})
5		df-nlly 23786	. 2 ⊢ 𝑛-Locally 𝐴 = {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐴}
6		df-nlly 23786	. 2 ⊢ 𝑛-Locally 𝐵 = {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ 𝑥 ∃𝑢 ∈ (((nei‘𝑗)‘{𝑦}) ∩ 𝒫 𝑥)(𝑗 ↾t 𝑢) ∈ 𝐵}
7	4, 5, 6	3eqtr4g 2821	1 ⊢ (𝐴 = 𝐵 → 𝑛-Locally 𝐴 = 𝑛-Locally 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  {crab 3413   ∩ cin 3898  𝒫 cpw 4557  {csn 4584  ‘cfv 6538  (class class class)co 7420   ↾_t crest 17591  Topctop 23211  neicnei 23415  𝑛-Locally cnlly 23784

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-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-nlly 23786

This theorem is used by: (None)