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

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

Proof of Theorem imasnopn
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 nfv 1843 . . . 4 𝑦((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋))
2 nfcv 2764 . . . 4 𝑦(𝑅 “ {𝐴})
3 nfrab1 3122 . . . 4 𝑦{𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
4 txtop 21372 . . . . . . . . . . . . 13 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 ×t 𝐾) ∈ Top)
54adantr 481 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝐽 ×t 𝐾) ∈ Top)
6 simprl 794 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → 𝑅 ∈ (𝐽 ×t 𝐾))
7 eqid 2622 . . . . . . . . . . . . 13 (𝐽 ×t 𝐾) = (𝐽 ×t 𝐾)
87eltopss 20712 . . . . . . . . . . . 12 (((𝐽 ×t 𝐾) ∈ Top ∧ 𝑅 ∈ (𝐽 ×t 𝐾)) → 𝑅 (𝐽 ×t 𝐾))
95, 6, 8syl2anc 693 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → 𝑅 (𝐽 ×t 𝐾))
10 imasnopn.1 . . . . . . . . . . . . 13 𝑋 = 𝐽
11 eqid 2622 . . . . . . . . . . . . 13 𝐾 = 𝐾
1210, 11txuni 21395 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝑋 × 𝐾) = (𝐽 ×t 𝐾))
1312adantr 481 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑋 × 𝐾) = (𝐽 ×t 𝐾))
149, 13sseqtr4d 3642 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → 𝑅 ⊆ (𝑋 × 𝐾))
15 imass1 5500 . . . . . . . . . 10 (𝑅 ⊆ (𝑋 × 𝐾) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝐾) “ {𝐴}))
1614, 15syl 17 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝐾) “ {𝐴}))
17 xpimasn 5579 . . . . . . . . . 10 (𝐴𝑋 → ((𝑋 × 𝐾) “ {𝐴}) = 𝐾)
1817ad2antll 765 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → ((𝑋 × 𝐾) “ {𝐴}) = 𝐾)
1916, 18sseqtrd 3641 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ⊆ 𝐾)
2019sseld 3602 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) → 𝑦 𝐾))
2120pm4.71rd 667 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 𝐾𝑦 ∈ (𝑅 “ {𝐴}))))
22 vex 3203 . . . . . . . . 9 𝑦 ∈ V
23 elimasng 5491 . . . . . . . . 9 ((𝐴𝑋𝑦 ∈ V) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
2422, 23mpan2 707 . . . . . . . 8 (𝐴𝑋 → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
2524ad2antll 765 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
2625anbi2d 740 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → ((𝑦 𝐾𝑦 ∈ (𝑅 “ {𝐴})) ↔ (𝑦 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
2721, 26bitrd 268 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
28 rabid 3116 . . . . 5 (𝑦 ∈ {𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅} ↔ (𝑦 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
2927, 28syl6bbr 278 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ 𝑦 ∈ {𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}))
301, 2, 3, 29eqrd 3622 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) = {𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅})
31 eqid 2622 . . . 4 (𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) = (𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩)
3231mptpreima 5628 . . 3 ((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) = {𝑦 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
3330, 32syl6eqr 2674 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) = ((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅))
3411toptopon 20722 . . . . . 6 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘ 𝐾))
3534biimpi 206 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘ 𝐾))
3635ad2antlr 763 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → 𝐾 ∈ (TopOn‘ 𝐾))
3710toptopon 20722 . . . . . . 7 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
3837biimpi 206 . . . . . 6 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
3938ad2antrr 762 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → 𝐽 ∈ (TopOn‘𝑋))
40 simprr 796 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → 𝐴𝑋)
4136, 39, 40cnmptc 21465 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑦 𝐾𝐴) ∈ (𝐾 Cn 𝐽))
4236cnmptid 21464 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑦 𝐾𝑦) ∈ (𝐾 Cn 𝐾))
4336, 41, 42cnmpt1t 21468 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)))
44 cnima 21069 . . 3 (((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)) ∧ 𝑅 ∈ (𝐽 ×t 𝐾)) → ((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) ∈ 𝐾)
4543, 6, 44syl2anc 693 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → ((𝑦 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) ∈ 𝐾)
4633, 45eqeltrd 2701 1 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ∈ 𝐾)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  {crab 2916  Vcvv 3200  wss 3574  {csn 4177  cop 4183   cuni 4436  cmpt 4729   × cxp 5112  ccnv 5113  cima 5117  cfv 5888  (class class class)co 6650  Topctop 20698  TopOnctopon 20715   Cn ccn 21028   ×t ctx 21363
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-map 7859  df-topgen 16104  df-top 20699  df-topon 20716  df-bases 20750  df-cn 21031  df-cnp 21032  df-tx 21365
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator