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

Theorem topgele 14197
Description: The topologies over the same set have the greatest element (the discrete topology) and the least element (the indiscrete topology). (Contributed by FL, 18-Apr-2010.) (Revised by Mario Carneiro, 16-Sep-2015.)
Assertion
Ref Expression
topgele (𝐽 ∈ (TopOn‘𝑋) → ({∅, 𝑋} ⊆ 𝐽𝐽 ⊆ 𝒫 𝑋))

Proof of Theorem topgele
StepHypRef Expression
1 topontop 14182 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
2 0opn 14174 . . . 4 (𝐽 ∈ Top → ∅ ∈ 𝐽)
31, 2syl 14 . . 3 (𝐽 ∈ (TopOn‘𝑋) → ∅ ∈ 𝐽)
4 toponmax 14193 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
5 0ex 4156 . . . 4 ∅ ∈ V
6 prssg 3775 . . . 4 ((∅ ∈ V ∧ 𝑋𝐽) → ((∅ ∈ 𝐽𝑋𝐽) ↔ {∅, 𝑋} ⊆ 𝐽))
75, 4, 6sylancr 414 . . 3 (𝐽 ∈ (TopOn‘𝑋) → ((∅ ∈ 𝐽𝑋𝐽) ↔ {∅, 𝑋} ⊆ 𝐽))
83, 4, 7mpbi2and 945 . 2 (𝐽 ∈ (TopOn‘𝑋) → {∅, 𝑋} ⊆ 𝐽)
9 toponuni 14183 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
10 eqimss2 3234 . . . 4 (𝑋 = 𝐽 𝐽𝑋)
119, 10syl 14 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝐽𝑋)
12 sspwuni 3997 . . 3 (𝐽 ⊆ 𝒫 𝑋 𝐽𝑋)
1311, 12sylibr 134 . 2 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ⊆ 𝒫 𝑋)
148, 13jca 306 1 (𝐽 ∈ (TopOn‘𝑋) → ({∅, 𝑋} ⊆ 𝐽𝐽 ⊆ 𝒫 𝑋))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1364  wcel 2164  Vcvv 2760  wss 3153  c0 3446  𝒫 cpw 3601  {cpr 3619   cuni 3835  cfv 5254  Topctop 14165  TopOnctopon 14178
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-iota 5215  df-fun 5256  df-fv 5262  df-top 14166  df-topon 14179
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator