Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > ntrneicls11 | Structured version Visualization version GIF version |
Description: If (pseudo-)interior and (pseudo-)neighborhood functions are related by the operator, 𝐹, then conditions equal to claiming that the interior of the empty set is the empty set hold equally. (Contributed by RP, 2-Jun-2021.) |
Ref | Expression |
---|---|
ntrnei.o | ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) |
ntrnei.f | ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) |
ntrnei.r | ⊢ (𝜑 → 𝐼𝐹𝑁) |
Ref | Expression |
---|---|
ntrneicls11 | ⊢ (𝜑 → ((𝐼‘∅) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ ∅ ∈ (𝑁‘𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ntrnei.o | . . . . . . . . 9 ⊢ 𝑂 = (𝑖 ∈ V, 𝑗 ∈ V ↦ (𝑘 ∈ (𝒫 𝑗 ↑m 𝑖) ↦ (𝑙 ∈ 𝑗 ↦ {𝑚 ∈ 𝑖 ∣ 𝑙 ∈ (𝑘‘𝑚)}))) | |
2 | ntrnei.f | . . . . . . . . 9 ⊢ 𝐹 = (𝒫 𝐵𝑂𝐵) | |
3 | ntrnei.r | . . . . . . . . 9 ⊢ (𝜑 → 𝐼𝐹𝑁) | |
4 | 1, 2, 3 | ntrneiiex 40419 | . . . . . . . 8 ⊢ (𝜑 → 𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵)) |
5 | elmapi 8422 | . . . . . . . 8 ⊢ (𝐼 ∈ (𝒫 𝐵 ↑m 𝒫 𝐵) → 𝐼:𝒫 𝐵⟶𝒫 𝐵) | |
6 | 4, 5 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐼:𝒫 𝐵⟶𝒫 𝐵) |
7 | 0elpw 5248 | . . . . . . . 8 ⊢ ∅ ∈ 𝒫 𝐵 | |
8 | 7 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → ∅ ∈ 𝒫 𝐵) |
9 | 6, 8 | ffvelrnd 6846 | . . . . . 6 ⊢ (𝜑 → (𝐼‘∅) ∈ 𝒫 𝐵) |
10 | 9 | elpwid 4552 | . . . . 5 ⊢ (𝜑 → (𝐼‘∅) ⊆ 𝐵) |
11 | reldisj 4401 | . . . . 5 ⊢ ((𝐼‘∅) ⊆ 𝐵 → (((𝐼‘∅) ∩ 𝐵) = ∅ ↔ (𝐼‘∅) ⊆ (𝐵 ∖ 𝐵))) | |
12 | 10, 11 | syl 17 | . . . 4 ⊢ (𝜑 → (((𝐼‘∅) ∩ 𝐵) = ∅ ↔ (𝐼‘∅) ⊆ (𝐵 ∖ 𝐵))) |
13 | 12 | bicomd 225 | . . 3 ⊢ (𝜑 → ((𝐼‘∅) ⊆ (𝐵 ∖ 𝐵) ↔ ((𝐼‘∅) ∩ 𝐵) = ∅)) |
14 | difid 4329 | . . . . 5 ⊢ (𝐵 ∖ 𝐵) = ∅ | |
15 | 14 | sseq2i 3995 | . . . 4 ⊢ ((𝐼‘∅) ⊆ (𝐵 ∖ 𝐵) ↔ (𝐼‘∅) ⊆ ∅) |
16 | ss0b 4350 | . . . 4 ⊢ ((𝐼‘∅) ⊆ ∅ ↔ (𝐼‘∅) = ∅) | |
17 | 15, 16 | bitri 277 | . . 3 ⊢ ((𝐼‘∅) ⊆ (𝐵 ∖ 𝐵) ↔ (𝐼‘∅) = ∅) |
18 | disjr 4399 | . . 3 ⊢ (((𝐼‘∅) ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ 𝑥 ∈ (𝐼‘∅)) | |
19 | 13, 17, 18 | 3bitr3g 315 | . 2 ⊢ (𝜑 → ((𝐼‘∅) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ 𝑥 ∈ (𝐼‘∅))) |
20 | 3 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐼𝐹𝑁) |
21 | simpr 487 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
22 | 7 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∅ ∈ 𝒫 𝐵) |
23 | 1, 2, 20, 21, 22 | ntrneiel 40424 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝐼‘∅) ↔ ∅ ∈ (𝑁‘𝑥))) |
24 | 23 | notbid 320 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (¬ 𝑥 ∈ (𝐼‘∅) ↔ ¬ ∅ ∈ (𝑁‘𝑥))) |
25 | 24 | ralbidva 3196 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ¬ 𝑥 ∈ (𝐼‘∅) ↔ ∀𝑥 ∈ 𝐵 ¬ ∅ ∈ (𝑁‘𝑥))) |
26 | 19, 25 | bitrd 281 | 1 ⊢ (𝜑 → ((𝐼‘∅) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ ∅ ∈ (𝑁‘𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∀wral 3138 {crab 3142 Vcvv 3494 ∖ cdif 3932 ∩ cin 3934 ⊆ wss 3935 ∅c0 4290 𝒫 cpw 4538 class class class wbr 5058 ↦ cmpt 5138 ⟶wf 6345 ‘cfv 6349 (class class class)co 7150 ∈ cmpo 7152 ↑m cmap 8400 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-ov 7153 df-oprab 7154 df-mpo 7155 df-1st 7683 df-2nd 7684 df-map 8402 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |