ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ntrcls0 GIF version

Theorem ntrcls0 14451
Description: A subset whose closure has an empty interior also has an empty interior. (Contributed by NM, 4-Oct-2007.)
Hypothesis
Ref Expression
clscld.1 𝑋 = 𝐽
Assertion
Ref Expression
ntrcls0 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) = ∅)

Proof of Theorem ntrcls0
StepHypRef Expression
1 simpl 109 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝐽 ∈ Top)
2 clscld.1 . . . . . 6 𝑋 = 𝐽
32clsss3 14450 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
42sscls 14440 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
52ntrss 14439 . . . . 5 ((𝐽 ∈ Top ∧ ((cls‘𝐽)‘𝑆) ⊆ 𝑋𝑆 ⊆ ((cls‘𝐽)‘𝑆)) → ((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)))
61, 3, 4, 5syl3anc 1249 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)))
763adant3 1019 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)))
8 sseq2 3208 . . . 4 (((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅ → (((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ ((int‘𝐽)‘𝑆) ⊆ ∅))
983ad2ant3 1022 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → (((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ ((int‘𝐽)‘𝑆) ⊆ ∅))
107, 9mpbid 147 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) ⊆ ∅)
11 ss0 3492 . 2 (((int‘𝐽)‘𝑆) ⊆ ∅ → ((int‘𝐽)‘𝑆) = ∅)
1210, 11syl 14 1 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) = ∅)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 980   = wceq 1364  wcel 2167  wss 3157  c0 3451   cuni 3840  cfv 5259  Topctop 14317  intcnt 14413  clsccl 14414
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-top 14318  df-cld 14415  df-ntr 14416  df-cls 14417
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator