MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xkouni Structured version   Visualization version   GIF version

Theorem xkouni 23975
Description: The base set of the compact-open topology. (Contributed by Mario Carneiro, 19-Mar-2015.)
Hypothesis
Ref Expression
xkouni.1 𝐽 = (𝑆 ↑ko 𝑅)
Assertion
Ref Expression
xkouni ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) = ∪ 𝐽)

Proof of Theorem xkouni
Dummy variables 𝑓 𝑘 𝑣 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ima0 6092 . . . . . . . . 9 (𝑓 “ ∅) = ∅
2 0ss 4352 . . . . . . . . 9 ∅ ⊆ ∪ 𝑆
31, 2eqsstri 3958 . . . . . . . 8 (𝑓 “ ∅) ⊆ ∪ 𝑆
43a1i 11 . . . . . . 7 (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ 𝑓 ∈ (𝑅 Cn 𝑆)) → (𝑓 “ ∅) ⊆ ∪ 𝑆)
54ralrimiva 3161 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∀𝑓 ∈ (𝑅 Cn 𝑆)(𝑓 “ ∅) ⊆ ∪ 𝑆)
6 rabid2 3447 . . . . . 6 ((𝑅 Cn 𝑆) = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ ∅) ⊆ ∪ 𝑆} ↔ ∀𝑓 ∈ (𝑅 Cn 𝑆)(𝑓 “ ∅) ⊆ ∪ 𝑆)
75, 6sylibr 237 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ ∅) ⊆ ∪ 𝑆})
8 eqid 2766 . . . . . 6 ∪ 𝑅 = ∪ 𝑅
9 simpl 488 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝑅 ∈ Top)
10 simpr 490 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝑆 ∈ Top)
11 0ss 4352 . . . . . . 7 ∅ ⊆ ∪ 𝑅
1211a1i 11 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∅ ⊆ ∪ 𝑅)
13 rest0 23544 . . . . . . . 8 (𝑅 ∈ Top → (𝑅 ↾t ∅) = {∅})
1413adantr 486 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ↾t ∅) = {∅})
15 0cmp 23769 . . . . . . 7 {∅} ∈ Comp
1614, 15eqeltrdi 2875 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ↾t ∅) ∈ Comp)
17 eqid 2766 . . . . . . . 8 ∪ 𝑆 = ∪ 𝑆
1817topopn 23281 . . . . . . 7 (𝑆 ∈ Top → ∪ 𝑆 ∈ 𝑆)
1918adantl 487 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ 𝑆 ∈ 𝑆)
208, 9, 10, 12, 16, 19xkoopn 23965 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ ∅) ⊆ ∪ 𝑆} ∈ (𝑆 ↑ko 𝑅))
217, 20eqeltrd 2867 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) ∈ (𝑆 ↑ko 𝑅))
22 xkouni.1 . . . 4 𝐽 = (𝑆 ↑ko 𝑅)
2321, 22eleqtrrdi 2878 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) ∈ 𝐽)
24 elssuni 4903 . . 3 ((𝑅 Cn 𝑆) ∈ 𝐽 → (𝑅 Cn 𝑆) ⊆ ∪ 𝐽)
2523, 24syl 18 . 2 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) ⊆ ∪ 𝐽)
26 eqid 2766 . . . . . 6 {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp} = {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}
27 eqid 2766 . . . . . 6 (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})
288, 26, 27xkoval 23963 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆 ↑ko 𝑅) = (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))))
2928unieqd 4884 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ (𝑆 ↑ko 𝑅) = ∪ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))))
3022unieqi 4883 . . . 4 ∪ 𝐽 = ∪ (𝑆 ↑ko 𝑅)
31 ovex 7483 . . . . . . . 8 (𝑅 Cn 𝑆) ∈ V
3231pwex 5348 . . . . . . 7 𝒫 (𝑅 Cn 𝑆) ∈ V
338, 26, 27xkotf 23961 . . . . . . . 8 (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}):({𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp} × 𝑆)⟶𝒫 (𝑅 Cn 𝑆)
34 frn 6746 . . . . . . . 8 ((𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}):({𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp} × 𝑆)⟶𝒫 (𝑅 Cn 𝑆) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆))
3533, 34ax-mp 5 . . . . . . 7 ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆)
3632, 35ssexi 5290 . . . . . 6 ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ∈ V
37 fiuni 9456 . . . . . 6 (ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ∈ V → ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = ∪ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})))
3836, 37ax-mp 5 . . . . 5 ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = ∪ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))
39 fvex 6928 . . . . . 6 (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})) ∈ V
40 unitg 23342 . . . . . 6 ((fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})) ∈ V → ∪ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))) = ∪ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})))
4139, 40ax-mp 5 . . . . 5 ∪ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))) = ∪ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))
4238, 41eqtr4i 2792 . . . 4 ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = ∪ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})))
4329, 30, 423eqtr4g 2826 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ 𝐽 = ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))
4435a1i 11 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆))
45 sspwuni 5064 . . . 4 (ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆) ↔ ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ (𝑅 Cn 𝑆))
4644, 45sylib 221 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ (𝑅 Cn 𝑆))
4743, 46eqsstrd 3946 . 2 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ 𝐽 ⊆ (𝑅 Cn 𝑆))
4825, 47eqssd 3929 1 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) = ∪ 𝐽)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∀wral 3083  {crab 3415  Vcvv 3453   ⊆ wss 3899  ∅c0 4280  𝒫 cpw 4559  {csn 4587  ∪ cuni 4871   × cxp 5655  ran crn 5658   “ cima 5660  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452  ficfi 9438   ↾t crest 17643  topGenctg 17660  Topctop 23268   Cn ccn 23599  Compccmp 23761   ↑ko cxko 23937
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-1o 8513  df-2o 8514  df-en 9011  df-fin 9014  df-fi 9439  df-rest 17645  df-topgen 17666  df-top 23269  df-topon 23286  df-bases 23321  df-cmp 23762  df-xko 23939
This theorem is used by:  xkotopon  23976  xkohaus  24029  xkoptsub  24030
  Copyright terms: Public domain W3C validator