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

Theorem imasncld 23629
Description: If a relation graph is closed, then an image set of a singleton is also closed. Corollary of Proposition 4 of [BourbakiTop1] p. I.26. (Contributed by Thierry Arnoux, 14-Jan-2018.)
Hypothesis
Ref Expression
imasnopn.1 𝑋 = 𝐽
Assertion
Ref Expression
imasncld (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ∈ (Clsd‘𝐾))

Proof of Theorem imasncld
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 nfv 1914 . . . 4 𝑦((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋))
2 nfcv 2898 . . . 4 𝑦(𝑅 “ {𝐴})
3 nfrab1 3436 . . . 4 𝑦{𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
4 simprl 770 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → 𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)))
5 eqid 2735 . . . . . . . . . . . . 13 (𝐽 ×t 𝐾) = (𝐽 ×t 𝐾)
65cldss 22967 . . . . . . . . . . . 12 (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) → 𝑅 (𝐽 ×t 𝐾))
74, 6syl 17 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → 𝑅 (𝐽 ×t 𝐾))
8 imasnopn.1 . . . . . . . . . . . . 13 𝑋 = 𝐽
9 eqid 2735 . . . . . . . . . . . . 13 𝐾 = 𝐾
108, 9txuni 23530 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝑋 × 𝐾) = (𝐽 ×t 𝐾))
1110adantr 480 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑋 × 𝐾) = (𝐽 ×t 𝐾))
127, 11sseqtrrd 3996 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → 𝑅 ⊆ (𝑋 × 𝐾))
13 imass1 6088 . . . . . . . . . 10 (𝑅 ⊆ (𝑋 × 𝐾) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝐾) “ {𝐴}))
1412, 13syl 17 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝐾) “ {𝐴}))
15 xpimasn 6174 . . . . . . . . . 10 (𝐴𝑋 → ((𝑋 × 𝐾) “ {𝐴}) = 𝐾)
1615ad2antll 729 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → ((𝑋 × 𝐾) “ {𝐴}) = 𝐾)
1714, 16sseqtrd 3995 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ⊆ 𝐾)
1817sseld 3957 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) → 𝑦 𝐾))
1918pm4.71rd 562 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 𝐾𝑦 ∈ (𝑅 “ {𝐴}))))
20 elimasng 6076 . . . . . . . . 9 ((𝐴𝑋𝑦 ∈ V) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
2120elvd 3465 . . . . . . . 8 (𝐴𝑋 → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
2221ad2antll 729 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
2322anbi2d 630 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → ((𝑦 𝐾𝑦 ∈ (𝑅 “ {𝐴})) ↔ (𝑦 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
2419, 23bitrd 279 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
25 rabid 3437 . . . . 5 (𝑦 ∈ {𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅} ↔ (𝑦 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
2624, 25bitr4di 289 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ 𝑦 ∈ {𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}))
271, 2, 3, 26eqrd 3978 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) = {𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅})
28 eqid 2735 . . . 4 (𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) = (𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩)
2928mptpreima 6227 . . 3 ((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) = {𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
3027, 29eqtr4di 2788 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) = ((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅))
319toptopon 22855 . . . . . 6 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
3231biimpi 216 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘ 𝐾))
3332ad2antlr 727 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → 𝐾 ∈ (TopOn‘ 𝐾))
348toptopon 22855 . . . . . . 7 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
3534biimpi 216 . . . . . 6 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
3635ad2antrr 726 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → 𝐽 ∈ (TopOn‘𝑋))
37 simprr 772 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → 𝐴𝑋)
3833, 36, 37cnmptc 23600 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑦 𝐾𝐴) ∈ (𝐾 Cn 𝐽))
3933cnmptid 23599 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑦 𝐾𝑦) ∈ (𝐾 Cn 𝐾))
4033, 38, 39cnmpt1t 23603 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)))
41 cnclima 23206 . . 3 (((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)) ∧ 𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾))) → ((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) ∈ (Clsd‘𝐾))
4240, 4, 41syl2anc 584 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → ((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) ∈ (Clsd‘𝐾))
4330, 42eqeltrd 2834 1 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ∈ (Clsd‘𝐾))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2108  {crab 3415  Vcvv 3459  wss 3926  {csn 4601  cop 4607   cuni 4883  cmpt 5201   × cxp 5652  ccnv 5653  cima 5657  cfv 6531  (class class class)co 7405  Topctop 22831  TopOnctopon 22848  Clsdccld 22954   Cn ccn 23162   ×t ctx 23498
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7988  df-2nd 7989  df-map 8842  df-topgen 17457  df-top 22832  df-topon 22849  df-bases 22884  df-cld 22957  df-cn 23165  df-cnp 23166  df-tx 23500
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator