Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  hausgraph Structured version   Visualization version   GIF version

Theorem hausgraph 44046
Description: The graph of a continuous function into a Hausdorff space is closed. (Contributed by Stefan O'Rear, 25-Jan-2015.)
Assertion
Ref Expression
hausgraph ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (Clsd‘(𝐽 ×t 𝐾)))

Proof of Theorem hausgraph
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 f1stres 8010 . . . . . . . . 9 (1st ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐽
2 ffn 6702 . . . . . . . . 9 ((1st ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐽 → (1st ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾))
31, 2ax-mp 5 . . . . . . . 8 (1st ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾)
4 fvco2 6975 . . . . . . . 8 (((1st ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)))
53, 4mpan 703 . . . . . . 7 (𝑎 ∈ ( 𝐽 × 𝐾) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)))
65adantl 487 . . . . . 6 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)))
7 fvres 6897 . . . . . . . 8 (𝑎 ∈ ( 𝐽 × 𝐾) → ((1st ↾ ( 𝐽 × 𝐾))‘𝑎) = (1st𝑎))
87fveq2d 6882 . . . . . . 7 (𝑎 ∈ ( 𝐽 × 𝐾) → (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)) = (𝐹‘(1st𝑎)))
98adantl 487 . . . . . 6 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)) = (𝐹‘(1st𝑎)))
106, 9eqtrd 2795 . . . . 5 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘(1st𝑎)))
11 fvres 6897 . . . . . 6 (𝑎 ∈ ( 𝐽 × 𝐾) → ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎) = (2nd𝑎))
1211adantl 487 . . . . 5 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎) = (2nd𝑎))
1310, 12eqeq12d 2776 . . . 4 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → (((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎) ↔ (𝐹‘(1st𝑎)) = (2nd𝑎)))
1413rabbidva 3418 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → {𝑎 ∈ ( 𝐽 × 𝐾) ∣ ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎)} = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ (𝐹‘(1st𝑎)) = (2nd𝑎)})
15 eqid 2760 . . . . . . . 8 𝐽 = 𝐽
16 eqid 2760 . . . . . . . 8 𝐾 = 𝐾
1715, 16cnf 23471 . . . . . . 7 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹: 𝐽 𝐾)
1817adantl 487 . . . . . 6 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽 𝐾)
19 fco 6727 . . . . . 6 ((𝐹: 𝐽 𝐾 ∧ (1st ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐽) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))):( 𝐽 × 𝐾)⟶ 𝐾)
2018, 1, 19sylancl 598 . . . . 5 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))):( 𝐽 × 𝐾)⟶ 𝐾)
2120ffnd 6703 . . . 4 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) Fn ( 𝐽 × 𝐾))
22 f2ndres 8011 . . . . 5 (2nd ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐾
23 ffn 6702 . . . . 5 ((2nd ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐾 → (2nd ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾))
2422, 23ax-mp 5 . . . 4 (2nd ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾)
25 fndmin 7037 . . . 4 (((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) Fn ( 𝐽 × 𝐾) ∧ (2nd ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾)) → dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))) = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎)})
2621, 24, 25sylancl 598 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))) = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎)})
27 fgraphxp 44045 . . . 4 (𝐹: 𝐽 𝐾𝐹 = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ (𝐹‘(1st𝑎)) = (2nd𝑎)})
2818, 27syl 18 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ (𝐹‘(1st𝑎)) = (2nd𝑎)})
2914, 26, 283eqtr4rd 2806 . 2 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 = dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))))
30 simpl 488 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Haus)
31 cntop1 23465 . . . . . . 7 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
3231adantl 487 . . . . . 6 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ Top)
3315toptopon 23142 . . . . . 6 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘ 𝐽))
3432, 33sylib 221 . . . . 5 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ (TopOn‘ 𝐽))
35 haustop 23556 . . . . . . 7 (𝐾 ∈ Haus → 𝐾 ∈ Top)
3630, 35syl 18 . . . . . 6 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Top)
3716toptopon 23142 . . . . . 6 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
3836, 37sylib 221 . . . . 5 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ (TopOn‘ 𝐾))
39 tx1cn 23835 . . . . 5 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (1st ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐽))
4034, 38, 39syl2anc 596 . . . 4 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (1st ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐽))
41 cnco 23491 . . . 4 (((1st ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐽) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
4240, 41sylancom 600 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
43 tx2cn 23836 . . . 4 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (2nd ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
4434, 38, 43syl2anc 596 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (2nd ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
4530, 42, 44hauseqlcld 23872 . 2 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))) ∈ (Clsd‘(𝐽 ×t 𝐾)))
4629, 45eqeltrd 2860 1 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (Clsd‘(𝐽 ×t 𝐾)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  {crab 3412  cin 3898   cuni 4867   × cxp 5653  dom cdm 5655  cres 5657  ccom 5659   Fn wfn 6528  wf 6529  cfv 6533  (class class class)co 7413  1st c1st 7984  2nd c2nd 7985  Topctop 23118  TopOnctopon 23135  Clsdccld 23241   Cn ccn 23449  Hauscha 23533   ×t ctx 23786
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-map 8828  df-topgen 17528  df-top 23119  df-topon 23136  df-bases 23171  df-cld 23244  df-cn 23452  df-haus 23540  df-tx 23788
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator