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

Theorem imasncls 23715
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 22938 . . . . . 6 (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
32biimpi 216 . . . . 5 (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘𝑌))
43ad2antlr 727 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝐾 ∈ (TopOn‘𝑌))
5 imasnopn.1 . . . . . . . 8 𝑋 = 𝐽
65toptopon 22938 . . . . . . 7 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
76biimpi 216 . . . . . 6 (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
87ad2antrr 726 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝐽 ∈ (TopOn‘𝑋))
9 simprr 773 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝐴𝑋)
104, 8, 9cnmptc 23685 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦𝑌𝐴) ∈ (𝐾 Cn 𝐽))
114cnmptid 23684 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦𝑌𝑦) ∈ (𝐾 Cn 𝐾))
124, 10, 11cnmpt1t 23688 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)))
13 simprl 771 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝑅 ⊆ (𝑋 × 𝑌))
145, 1txuni 23615 . . . . 5 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝑋 × 𝑌) = (𝐽 ×t 𝐾))
1514adantr 480 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑋 × 𝑌) = (𝐽 ×t 𝐾))
1613, 15sseqtrd 4035 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → 𝑅 (𝐽 ×t 𝐾))
17 eqid 2734 . . . 4 (𝐽 ×t 𝐾) = (𝐽 ×t 𝐾)
1817cncls2i 23293 . . 3 (((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)) ∧ 𝑅 (𝐽 ×t 𝐾)) → ((cls‘𝐾)‘((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅)) ⊆ ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
1912, 16, 18syl2anc 584 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘𝐾)‘((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅)) ⊆ ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
20 nfv 1911 . . . . 5 𝑦((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋))
21 nfcv 2902 . . . . 5 𝑦(𝑅 “ {𝐴})
22 nfrab1 3453 . . . . 5 𝑦{𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
23 imass1 6121 . . . . . . . . . . 11 (𝑅 ⊆ (𝑋 × 𝑌) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
2413, 23syl 17 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
25 xpimasn 6206 . . . . . . . . . . 11 (𝐴𝑋 → ((𝑋 × 𝑌) “ {𝐴}) = 𝑌)
2625ad2antll 729 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((𝑋 × 𝑌) “ {𝐴}) = 𝑌)
2724, 26sseqtrd 4035 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) ⊆ 𝑌)
2827sseld 3993 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) → 𝑦𝑌))
2928pm4.71rd 562 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦𝑌𝑦 ∈ (𝑅 “ {𝐴}))))
30 elimasng 6108 . . . . . . . . . 10 ((𝐴𝑋𝑦 ∈ V) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
3130elvd 3483 . . . . . . . . 9 (𝐴𝑋 → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
3231ad2antll 729 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
3332anbi2d 630 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((𝑦𝑌𝑦 ∈ (𝑅 “ {𝐴})) ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
3429, 33bitrd 279 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
35 rabid 3454 . . . . . 6 (𝑦 ∈ {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅} ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
3634, 35bitr4di 289 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ 𝑦 ∈ {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}))
3720, 21, 22, 36eqrd 4014 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) = {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅})
38 eqid 2734 . . . . 5 (𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) = (𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩)
3938mptpreima 6259 . . . 4 ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) = {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
4037, 39eqtr4di 2792 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑅 “ {𝐴}) = ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅))
4140fveq2d 6910 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘𝐾)‘(𝑅 “ {𝐴})) = ((cls‘𝐾)‘((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅)))
42 nfcv 2902 . . . 4 𝑦(((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴})
43 nfrab1 3453 . . . 4 𝑦{𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)}
44 txtop 23592 . . . . . . . . . . . . 13 ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 ×t 𝐾) ∈ Top)
4544adantr 480 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝐽 ×t 𝐾) ∈ Top)
4617clsss3 23082 . . . . . . . . . . . 12 (((𝐽 ×t 𝐾) ∈ Top ∧ 𝑅 (𝐽 ×t 𝐾)) → ((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝐽 ×t 𝐾))
4745, 16, 46syl2anc 584 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝐽 ×t 𝐾))
4847, 15sseqtrrd 4036 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝑋 × 𝑌))
49 imass1 6121 . . . . . . . . . 10 (((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝑋 × 𝑌) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
5048, 49syl 17 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
5150, 26sseqtrd 4035 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ⊆ 𝑌)
5251sseld 3993 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) → 𝑦𝑌))
5352pm4.71rd 562 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ (𝑦𝑌𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}))))
54 elimasng 6108 . . . . . . . . 9 ((𝐴𝑋𝑦 ∈ V) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
5554elvd 3483 . . . . . . . 8 (𝐴𝑋 → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
5655ad2antll 729 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
5756anbi2d 630 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((𝑦𝑌𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴})) ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅))))
5853, 57bitrd 279 . . . . 5 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅))))
59 rabid 3454 . . . . 5 (𝑦 ∈ {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)} ↔ (𝑦𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
6058, 59bitr4di 289 . . . 4 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ 𝑦 ∈ {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)}))
6120, 42, 43, 60eqrd 4014 . . 3 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) = {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)})
6238mptpreima 6259 . . 3 ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)) = {𝑦𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)}
6361, 62eqtr4di 2792 . 2 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) = ((𝑦𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
6419, 41, 633sstr4d 4042 1 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴𝑋)) → ((cls‘𝐾)‘(𝑅 “ {𝐴})) ⊆ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1536  wcel 2105  {crab 3432  Vcvv 3477  wss 3962  {csn 4630  cop 4636   cuni 4911  cmpt 5230   × cxp 5686  ccnv 5687  cima 5691  cfv 6562  (class class class)co 7430  Topctop 22914  TopOnctopon 22931  clsccl 23041   Cn ccn 23247   ×t ctx 23583
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-rep 5284  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-reu 3378  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-int 4951  df-iun 4997  df-iin 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-f1 6567  df-fo 6568  df-f1o 6569  df-fv 6570  df-ov 7433  df-oprab 7434  df-mpo 7435  df-1st 8012  df-2nd 8013  df-map 8866  df-topgen 17489  df-top 22915  df-topon 22932  df-bases 22968  df-cld 23042  df-cls 23044  df-cn 23250  df-cnp 23251  df-tx 23585
This theorem is referenced by:  utopreg  24276
  Copyright terms: Public domain W3C validator