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 43990
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 8016 . . . . . . . . 9 (1st ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐽
2 ffn 6709 . . . . . . . . 9 ((1st ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐽 → (1st ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾))
31, 2ax-mp 5 . . . . . . . 8 (1st ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾)
4 fvco2 6982 . . . . . . . 8 (((1st ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)))
53, 4mpan 703 . . . . . . 7 (𝑎 ∈ ( 𝐽 × 𝐾) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)))
65adantl 487 . . . . . 6 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)))
7 fvres 6904 . . . . . . . 8 (𝑎 ∈ ( 𝐽 × 𝐾) → ((1st ↾ ( 𝐽 × 𝐾))‘𝑎) = (1st𝑎))
87fveq2d 6889 . . . . . . 7 (𝑎 ∈ ( 𝐽 × 𝐾) → (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)) = (𝐹‘(1st𝑎)))
98adantl 487 . . . . . 6 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)) = (𝐹‘(1st𝑎)))
106, 9eqtrd 2800 . . . . 5 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘(1st𝑎)))
11 fvres 6904 . . . . . 6 (𝑎 ∈ ( 𝐽 × 𝐾) → ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎) = (2nd𝑎))
1211adantl 487 . . . . 5 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎) = (2nd𝑎))
1310, 12eqeq12d 2781 . . . 4 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → (((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎) ↔ (𝐹‘(1st𝑎)) = (2nd𝑎)))
1413rabbidva 3424 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → {𝑎 ∈ ( 𝐽 × 𝐾) ∣ ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎)} = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ (𝐹‘(1st𝑎)) = (2nd𝑎)})
15 eqid 2765 . . . . . . . 8 𝐽 = 𝐽
16 eqid 2765 . . . . . . . 8 𝐾 = 𝐾
1715, 16cnf 23453 . . . . . . 7 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹: 𝐽 𝐾)
1817adantl 487 . . . . . 6 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽 𝐾)
19 fco 6734 . . . . . 6 ((𝐹: 𝐽 𝐾 ∧ (1st ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐽) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))):( 𝐽 × 𝐾)⟶ 𝐾)
2018, 1, 19sylancl 598 . . . . 5 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))):( 𝐽 × 𝐾)⟶ 𝐾)
2120ffnd 6710 . . . 4 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) Fn ( 𝐽 × 𝐾))
22 f2ndres 8017 . . . . 5 (2nd ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐾
23 ffn 6709 . . . . 5 ((2nd ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐾 → (2nd ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾))
2422, 23ax-mp 5 . . . 4 (2nd ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾)
25 fndmin 7044 . . . 4 (((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) Fn ( 𝐽 × 𝐾) ∧ (2nd ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾)) → dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))) = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎)})
2621, 24, 25sylancl 598 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))) = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎)})
27 fgraphxp 43989 . . . 4 (𝐹: 𝐽 𝐾𝐹 = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ (𝐹‘(1st𝑎)) = (2nd𝑎)})
2818, 27syl 18 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ (𝐹‘(1st𝑎)) = (2nd𝑎)})
2914, 26, 283eqtr4rd 2811 . 2 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 = dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))))
30 simpl 488 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Haus)
31 cntop1 23447 . . . . . . 7 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
3231adantl 487 . . . . . 6 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ Top)
3315toptopon 23124 . . . . . 6 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘ 𝐽))
3432, 33sylib 221 . . . . 5 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ (TopOn‘ 𝐽))
35 haustop 23538 . . . . . . 7 (𝐾 ∈ Haus → 𝐾 ∈ Top)
3630, 35syl 18 . . . . . 6 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Top)
3716toptopon 23124 . . . . . 6 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
3836, 37sylib 221 . . . . 5 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ (TopOn‘ 𝐾))
39 tx1cn 23817 . . . . 5 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (1st ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐽))
4034, 38, 39syl2anc 596 . . . 4 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (1st ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐽))
41 cnco 23473 . . . 4 (((1st ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐽) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
4240, 41sylancom 600 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
43 tx2cn 23818 . . . 4 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (2nd ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
4434, 38, 43syl2anc 596 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (2nd ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
4530, 42, 44hauseqlcld 23854 . 2 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))) ∈ (Clsd‘(𝐽 ×t 𝐾)))
4629, 45eqeltrd 2865 1 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (Clsd‘(𝐽 ×t 𝐾)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  {crab 3418  cin 3905   cuni 4874   × cxp 5661  dom cdm 5663  cres 5665  ccom 5667   Fn wfn 6535  wf 6536  cfv 6540  (class class class)co 7419  1st c1st 7990  2nd c2nd 7991  Topctop 23100  TopOnctopon 23117  Clsdccld 23223   Cn ccn 23431  Hauscha 23515   ×t ctx 23768
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-map 8832  df-topgen 17518  df-top 23101  df-topon 23118  df-bases 23153  df-cld 23226  df-cn 23434  df-haus 23522  df-tx 23770
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator