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

Theorem ntrcls0 12300
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 108 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝐽 ∈ Top)
2 clscld.1 . . . . . 6 𝑋 = 𝐽
32clsss3 12299 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) ⊆ 𝑋)
42sscls 12289 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑆 ⊆ ((cls‘𝐽)‘𝑆))
52ntrss 12288 . . . . 5 ((𝐽 ∈ Top ∧ ((cls‘𝐽)‘𝑆) ⊆ 𝑋𝑆 ⊆ ((cls‘𝐽)‘𝑆)) → ((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)))
61, 3, 4, 5syl3anc 1216 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)))
763adant3 1001 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)))
8 sseq2 3121 . . . 4 (((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅ → (((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ ((int‘𝐽)‘𝑆) ⊆ ∅))
983ad2ant3 1004 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → (((int‘𝐽)‘𝑆) ⊆ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) ↔ ((int‘𝐽)‘𝑆) ⊆ ∅))
107, 9mpbid 146 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) ⊆ ∅)
11 ss0 3403 . 2 (((int‘𝐽)‘𝑆) ⊆ ∅ → ((int‘𝐽)‘𝑆) = ∅)
1210, 11syl 14 1 ((𝐽 ∈ Top ∧ 𝑆𝑋 ∧ ((int‘𝐽)‘((cls‘𝐽)‘𝑆)) = ∅) → ((int‘𝐽)‘𝑆) = ∅)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 962   = wceq 1331  wcel 1480  wss 3071  c0 3363   cuni 3736  cfv 5123  Topctop 12164  intcnt 12262  clsccl 12263
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-top 12165  df-cld 12264  df-ntr 12265  df-cls 12266
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator