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 43960
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 8006 . . . . . . . . 9 (1st ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐽
2 ffn 6705 . . . . . . . . 9 ((1st ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐽 → (1st ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾))
31, 2ax-mp 5 . . . . . . . 8 (1st ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾)
4 fvco2 6978 . . . . . . . 8 (((1st ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)))
53, 4mpan 702 . . . . . . 7 (𝑎 ∈ ( 𝐽 × 𝐾) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)))
65adantl 486 . . . . . 6 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)))
7 fvres 6900 . . . . . . . 8 (𝑎 ∈ ( 𝐽 × 𝐾) → ((1st ↾ ( 𝐽 × 𝐾))‘𝑎) = (1st𝑎))
87fveq2d 6885 . . . . . . 7 (𝑎 ∈ ( 𝐽 × 𝐾) → (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)) = (𝐹‘(1st𝑎)))
98adantl 486 . . . . . 6 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → (𝐹‘((1st ↾ ( 𝐽 × 𝐾))‘𝑎)) = (𝐹‘(1st𝑎)))
106, 9eqtrd 2798 . . . . 5 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = (𝐹‘(1st𝑎)))
11 fvres 6900 . . . . . 6 (𝑎 ∈ ( 𝐽 × 𝐾) → ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎) = (2nd𝑎))
1211adantl 486 . . . . 5 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎) = (2nd𝑎))
1310, 12eqeq12d 2779 . . . 4 (((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) ∧ 𝑎 ∈ ( 𝐽 × 𝐾)) → (((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎) ↔ (𝐹‘(1st𝑎)) = (2nd𝑎)))
1413rabbidva 3422 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → {𝑎 ∈ ( 𝐽 × 𝐾) ∣ ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎)} = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ (𝐹‘(1st𝑎)) = (2nd𝑎)})
15 eqid 2763 . . . . . . . 8 𝐽 = 𝐽
16 eqid 2763 . . . . . . . 8 𝐾 = 𝐾
1715, 16cnf 23412 . . . . . . 7 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹: 𝐽 𝐾)
1817adantl 486 . . . . . 6 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽 𝐾)
19 fco 6730 . . . . . 6 ((𝐹: 𝐽 𝐾 ∧ (1st ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐽) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))):( 𝐽 × 𝐾)⟶ 𝐾)
2018, 1, 19sylancl 597 . . . . 5 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))):( 𝐽 × 𝐾)⟶ 𝐾)
2120ffnd 6706 . . . 4 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) Fn ( 𝐽 × 𝐾))
22 f2ndres 8007 . . . . 5 (2nd ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐾
23 ffn 6705 . . . . 5 ((2nd ↾ ( 𝐽 × 𝐾)):( 𝐽 × 𝐾)⟶ 𝐾 → (2nd ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾))
2422, 23ax-mp 5 . . . 4 (2nd ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾)
25 fndmin 7040 . . . 4 (((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) Fn ( 𝐽 × 𝐾) ∧ (2nd ↾ ( 𝐽 × 𝐾)) Fn ( 𝐽 × 𝐾)) → dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))) = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎)})
2621, 24, 25sylancl 597 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))) = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾)))‘𝑎) = ((2nd ↾ ( 𝐽 × 𝐾))‘𝑎)})
27 fgraphxp 43959 . . . 4 (𝐹: 𝐽 𝐾𝐹 = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ (𝐹‘(1st𝑎)) = (2nd𝑎)})
2818, 27syl 18 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 = {𝑎 ∈ ( 𝐽 × 𝐾) ∣ (𝐹‘(1st𝑎)) = (2nd𝑎)})
2914, 26, 283eqtr4rd 2809 . 2 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 = dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))))
30 simpl 487 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Haus)
31 cntop1 23406 . . . . . . 7 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
3231adantl 486 . . . . . 6 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ Top)
3315toptopon 23083 . . . . . 6 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘ 𝐽))
3432, 33sylib 221 . . . . 5 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐽 ∈ (TopOn‘ 𝐽))
35 haustop 23497 . . . . . . 7 (𝐾 ∈ Haus → 𝐾 ∈ Top)
3630, 35syl 18 . . . . . 6 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ Top)
3716toptopon 23083 . . . . . 6 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
3836, 37sylib 221 . . . . 5 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐾 ∈ (TopOn‘ 𝐾))
39 tx1cn 23775 . . . . 5 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (1st ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐽))
4034, 38, 39syl2anc 595 . . . 4 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (1st ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐽))
41 cnco 23432 . . . 4 (((1st ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐽) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
4240, 41sylancom 599 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
43 tx2cn 23776 . . . 4 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘ 𝐾)) → (2nd ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
4434, 38, 43syl2anc 595 . . 3 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → (2nd ↾ ( 𝐽 × 𝐾)) ∈ ((𝐽 ×t 𝐾) Cn 𝐾))
4530, 42, 44hauseqlcld 23812 . 2 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → dom ((𝐹 ∘ (1st ↾ ( 𝐽 × 𝐾))) ∩ (2nd ↾ ( 𝐽 × 𝐾))) ∈ (Clsd‘(𝐽 ×t 𝐾)))
4629, 45eqeltrd 2863 1 ((𝐾 ∈ Haus ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹 ∈ (Clsd‘(𝐽 ×t 𝐾)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400   = wceq 1570  wcel 2143  {crab 3416  cin 3904   cuni 4872   × cxp 5659  dom cdm 5661  cres 5663  ccom 5665   Fn wfn 6531  wf 6532  cfv 6536  (class class class)co 7410  1st c1st 7980  2nd c2nd 7981  Topctop 23059  TopOnctopon 23076  Clsdccld 23182   Cn ccn 23390  Hauscha 23474   ×t ctx 23726
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-map 8822  df-topgen 17500  df-top 23060  df-topon 23077  df-bases 23112  df-cld 23185  df-cn 23393  df-haus 23481  df-tx 23728
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator