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

Theorem imasncls 22297
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.)
Hypotheses
Ref Expression
imasnopn.1 𝑋 = 𝐽
imasnopn.2 𝑌 = 𝐾
Assertion
Ref Expression
imasncls (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘𝐾)‘(𝑅 “ {𝐴})) ⊆ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}))

Proof of Theorem imasncls
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 imasnopn.2 . . . . . . 7 𝑌 = 𝐾
21toptopon 21522 . . . . . 6 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
32biimpi 219 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘𝑌))
43ad2antlr 726 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝐾 ∈ (TopOn‘𝑌))
5 imasnopn.1 . . . . . . . 8 𝑋 = 𝐽
65toptopon 21522 . . . . . . 7 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
76biimpi 219 . . . . . 6 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
87ad2antrr 725 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝐽 ∈ (TopOn‘𝑋))
9 simprr 772 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝐴𝑋)
104, 8, 9cnmptc 22267 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦𝑌𝐴) ∈ (𝐾 Cn 𝐽))
114cnmptid 22266 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦𝑌𝑦) ∈ (𝐾 Cn 𝐾))
124, 10, 11cnmpt1t 22270 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)))
13 simprl 770 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝑅 ⊆ (𝑋 × 𝑌))
145, 1txuni 22197 . . . . 5 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝑋 × 𝑌) = (𝐽 ×t 𝐾))
1514adantr 484 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑋 × 𝑌) = (𝐽 ×t 𝐾))
1613, 15sseqtrd 3955 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝑅 (𝐽 ×t 𝐾))
17 eqid 2798 . . . 4 (𝐽 ×t 𝐾) = (𝐽 ×t 𝐾)
1817cncls2i 21875 . . 3 (((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)) ∧ 𝑅 (𝐽 ×t 𝐾)) → ((cls‘𝐾)‘((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅)) ⊆ ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
1912, 16, 18syl2anc 587 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘𝐾)‘((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅)) ⊆ ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
20 nfv 1915 . . . . 5 𝑦((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋))
21 nfcv 2955 . . . . 5 𝑦(𝑅 “ {𝐴})
22 nfrab1 3337 . . . . 5 𝑦{𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
23 imass1 5931 . . . . . . . . . . 11 (𝑅 ⊆ (𝑋 × 𝑌) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
2413, 23syl 17 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
25 xpimasn 6009 . . . . . . . . . . 11 (𝐴𝑋 → ((𝑋 × 𝑌) “ {𝐴}) = 𝑌)
2625ad2antll 728 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((𝑋 × 𝑌) “ {𝐴}) = 𝑌)
2724, 26sseqtrd 3955 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ⊆ 𝑌)
2827sseld 3914 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) → 𝑦𝑌))
2928pm4.71rd 566 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦𝑌𝑦 ∈ (𝑅 “ {𝐴}))))
30 elimasng 5922 . . . . . . . . . 10 ((𝐴𝑋𝑦 ∈ V) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
3130elvd 3447 . . . . . . . . 9 (𝐴𝑋 → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
3231ad2antll 728 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
3332anbi2d 631 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((𝑦𝑌𝑦 ∈ (𝑅 “ {𝐴})) ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
3429, 33bitrd 282 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
35 rabid 3331 . . . . . 6 (𝑦 ∈ {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅} ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
3634, 35syl6bbr 292 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ 𝑦 ∈ {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}))
3720, 21, 22, 36eqrd 3934 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) = {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅})
38 eqid 2798 . . . . 5 (𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) = (𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩)
3938mptpreima 6059 . . . 4 ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) = {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
4037, 39eqtr4di 2851 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) = ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅))
4140fveq2d 6649 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘𝐾)‘(𝑅 “ {𝐴})) = ((cls‘𝐾)‘((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅)))
42 nfcv 2955 . . . 4 𝑦(((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴})
43 nfrab1 3337 . . . 4 𝑦{𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)}
44 txtop 22174 . . . . . . . . . . . . 13 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 ×t 𝐾) ∈ Top)
4544adantr 484 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝐽 ×t 𝐾) ∈ Top)
4617clsss3 21664 . . . . . . . . . . . 12 (((𝐽 ×t 𝐾) ∈ Top ∧ 𝑅 (𝐽 ×t 𝐾)) → ((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝐽 ×t 𝐾))
4745, 16, 46syl2anc 587 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝐽 ×t 𝐾))
4847, 15sseqtrrd 3956 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝑋 × 𝑌))
49 imass1 5931 . . . . . . . . . 10 (((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝑋 × 𝑌) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
5048, 49syl 17 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
5150, 26sseqtrd 3955 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ⊆ 𝑌)
5251sseld 3914 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) → 𝑦𝑌))
5352pm4.71rd 566 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ (𝑦𝑌𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}))))
54 elimasng 5922 . . . . . . . . 9 ((𝐴𝑋𝑦 ∈ V) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
5554elvd 3447 . . . . . . . 8 (𝐴𝑋 → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
5655ad2antll 728 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
5756anbi2d 631 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((𝑦𝑌𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴})) ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅))))
5853, 57bitrd 282 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅))))
59 rabid 3331 . . . . 5 (𝑦 ∈ {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)} ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
6058, 59syl6bbr 292 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ 𝑦 ∈ {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)}))
6120, 42, 43, 60eqrd 3934 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) = {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)})
6238mptpreima 6059 . . 3 ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)) = {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)}
6361, 62eqtr4di 2851 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) = ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
6419, 41, 633sstr4d 3962 1 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘𝐾)‘(𝑅 “ {𝐴})) ⊆ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  {crab 3110  Vcvv 3441  wss 3881  {csn 4525  cop 4531   cuni 4800  cmpt 5110   × cxp 5517  ccnv 5518  cima 5522  cfv 6324  (class class class)co 7135  Topctop 21498  TopOnctopon 21515  clsccl 21623   Cn ccn 21829   ×t ctx 22165
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  df-map 8391  df-topgen 16709  df-top 21499  df-topon 21516  df-bases 21551  df-cld 21624  df-cls 21626  df-cn 21832  df-cnp 21833  df-tx 22167
This theorem is referenced by:  utopreg  22858
  Copyright terms: Public domain W3C validator