Theorem imasncld 24022

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.

Step	Hyp	Ref	Expression
1		nfv 1948	. . . 4 ⊢ Ⅎ𝑦((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋))
2		nfcv 2925	. . . 4 ⊢ Ⅎ𝑦(𝑅 “ {𝐴})
3		nfrab1 3434	. . . 4 ⊢ Ⅎ𝑦{𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
4		simprl 783	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → 𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)))
5		eqid 2763	. . . . . . . . . . . . 13 ⊢ ∪ (𝐽 ×t 𝐾) = ∪ (𝐽 ×t 𝐾)
6	5	cldss 23359	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) → 𝑅 ⊆ ∪ (𝐽 ×t 𝐾))
7	4, 6	syl 18	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → 𝑅 ⊆ ∪ (𝐽 ×t 𝐾))
8		imasnopn.1	. . . . . . . . . . . . 13 ⊢ 𝑋 = ∪ 𝐽
9		eqid 2763	. . . . . . . . . . . . 13 ⊢ ∪ 𝐾 = ∪ 𝐾
10	8, 9	txuni 23923	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝑋 × ∪ 𝐾) = ∪ (𝐽 ×t 𝐾))
11	10	adantr 486	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑋 × ∪ 𝐾) = ∪ (𝐽 ×t 𝐾))
12	7, 11	sseqtrrd 3949	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → 𝑅 ⊆ (𝑋 × ∪ 𝐾))
13		imass1 6059	. . . . . . . . . 10 ⊢ (𝑅 ⊆ (𝑋 × ∪ 𝐾) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × ∪ 𝐾) “ {𝐴}))
14	12, 13	syl 18	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × ∪ 𝐾) “ {𝐴}))
15		xpimasn 6182	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑋 → ((𝑋 × ∪ 𝐾) “ {𝐴}) = ∪ 𝐾)
16	15	ad2antll 742	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → ((𝑋 × ∪ 𝐾) “ {𝐴}) = ∪ 𝐾)
17	14, 16	sseqtrd 3948	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) ⊆ ∪ 𝐾)
18	17	sseld 3911	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) → 𝑦 ∈ ∪ 𝐾))
19	18	pm4.71rd 572	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 ∈ ∪ 𝐾 ∧ 𝑦 ∈ (𝑅 “ {𝐴}))))
20		elimasng 6092	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝑦 ∈ V) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
21	20	elvd 3459	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑋 → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
22	21	ad2antll 742	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
23	22	anbi2d 642	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → ((𝑦 ∈ ∪ 𝐾 ∧ 𝑦 ∈ (𝑅 “ {𝐴})) ↔ (𝑦 ∈ ∪ 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
24	19, 23	bitrd 282	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 ∈ ∪ 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
25		rabid 3435	. . . . 5 ⊢ (𝑦 ∈ {𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅} ↔ (𝑦 ∈ ∪ 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
26	24, 25	bitr4di 292	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ 𝑦 ∈ {𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}))
27	1, 2, 3, 26	eqrd 3931	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) = {𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅})
28		eqid 2763	. . . 4 ⊢ (𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) = (𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩)
29	28	mptpreima 6245	. . 3 ⊢ (◡(𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) = {𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
30	27, 29	eqtr4di 2816	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) = (◡(𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅))
31	9	toptopon 23247	. . . . . 6 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
32	31	biimpi 219	. . . . 5 ⊢ (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘∪ 𝐾))
33	32	ad2antlr 740	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → 𝐾 ∈ (TopOn‘∪ 𝐾))
34	8	toptopon 23247	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
35	34	biimpi 219	. . . . . 6 ⊢ (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
36	35	ad2antrr 739	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → 𝐽 ∈ (TopOn‘𝑋))
37		simprr 785	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → 𝐴 ∈ 𝑋)
38	33, 36, 37	cnmptc 23993	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ ∪ 𝐾 ↦ 𝐴) ∈ (𝐾 Cn 𝐽))
39	33	cnmptid 23992	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ ∪ 𝐾 ↦ 𝑦) ∈ (𝐾 Cn 𝐾))
40	33, 38, 39	cnmpt1t 23996	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)))
41		cnclima 23598	. . 3 ⊢ (((𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)) ∧ 𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾))) → (◡(𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) ∈ (Clsd‘𝐾))
42	40, 4, 41	syl2anc 596	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (◡(𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) ∈ (Clsd‘𝐾))
43	30, 42	eqeltrd 2863	1 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (Clsd‘(𝐽 ×t 𝐾)) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) ∈ (Clsd‘𝐾))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  {crab 3415  Vcvv 3453   ⊆ wss 3899  {csn 4587  ⟨cop 4837  ∪ cuni 4869   ↦ cmpt 5188   × cxp 5652  ^◡ccnv 5653   “ cima 5657  ‘cfv 6546  (class class class)co 7427  Topctop 23223  TopOnctopon 23240  Clsdccld 23346   Cn ccn 23554   ×_t ctx 23891

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  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 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-ov 7430  df-oprab 7431  df-mpo 7432  df-1st 8008  df-2nd 8009  df-map 8860  df-topgen 17626  df-top 23224  df-topon 23241  df-bases 23276  df-cld 23349  df-cn 23557  df-cnp 23558  df-tx 23893

This theorem is used by: (None)