Theorem imasnopn 23989

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.

Step	Hyp	Ref	Expression
1		nfv 1947	. . . 4 ⊢ Ⅎ𝑦((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋))
2		nfcv 2923	. . . 4 ⊢ Ⅎ𝑦(𝑅 “ {𝐴})
3		nfrab1 3432	. . . 4 ⊢ Ⅎ𝑦{𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
4		txtop 23868	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 ×t 𝐾) ∈ Top)
5	4	adantr 486	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝐽 ×t 𝐾) ∈ Top)
6		simprl 783	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → 𝑅 ∈ (𝐽 ×t 𝐾))
7		eqid 2761	. . . . . . . . . . . . 13 ⊢ ∪ (𝐽 ×t 𝐾) = ∪ (𝐽 ×t 𝐾)
8	7	eltopss 23205	. . . . . . . . . . . 12 ⊢ (((𝐽 ×t 𝐾) ∈ Top ∧ 𝑅 ∈ (𝐽 ×t 𝐾)) → 𝑅 ⊆ ∪ (𝐽 ×t 𝐾))
9	5, 6, 8	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → 𝑅 ⊆ ∪ (𝐽 ×t 𝐾))
10		imasnopn.1	. . . . . . . . . . . . 13 ⊢ 𝑋 = ∪ 𝐽
11		eqid 2761	. . . . . . . . . . . . 13 ⊢ ∪ 𝐾 = ∪ 𝐾
12	10, 11	txuni 23891	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝑋 × ∪ 𝐾) = ∪ (𝐽 ×t 𝐾))
13	12	adantr 486	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑋 × ∪ 𝐾) = ∪ (𝐽 ×t 𝐾))
14	9, 13	sseqtrrd 3968	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → 𝑅 ⊆ (𝑋 × ∪ 𝐾))
15		imass1 6095	. . . . . . . . . 10 ⊢ (𝑅 ⊆ (𝑋 × ∪ 𝐾) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × ∪ 𝐾) “ {𝐴}))
16	14, 15	syl 18	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × ∪ 𝐾) “ {𝐴}))
17		xpimasn 6176	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑋 → ((𝑋 × ∪ 𝐾) “ {𝐴}) = ∪ 𝐾)
18	17	ad2antll 742	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → ((𝑋 × ∪ 𝐾) “ {𝐴}) = ∪ 𝐾)
19	16, 18	sseqtrd 3967	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) ⊆ ∪ 𝐾)
20	19	sseld 3930	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) → 𝑦 ∈ ∪ 𝐾))
21	20	pm4.71rd 572	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 ∈ ∪ 𝐾 ∧ 𝑦 ∈ (𝑅 “ {𝐴}))))
22		elimasng 6083	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝑦 ∈ V) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
23	22	elvd 3457	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑋 → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
24	23	ad2antll 742	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
25	24	anbi2d 642	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → ((𝑦 ∈ ∪ 𝐾 ∧ 𝑦 ∈ (𝑅 “ {𝐴})) ↔ (𝑦 ∈ ∪ 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
26	21, 25	bitrd 282	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 ∈ ∪ 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
27		rabid 3433	. . . . 5 ⊢ (𝑦 ∈ {𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅} ↔ (𝑦 ∈ ∪ 𝐾 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
28	26, 27	bitr4di 292	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ 𝑦 ∈ {𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}))
29	1, 2, 3, 28	eqrd 3950	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) = {𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅})
30		eqid 2761	. . . 4 ⊢ (𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) = (𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩)
31	30	mptpreima 6232	. . 3 ⊢ (◡(𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) = {𝑦 ∈ ∪ 𝐾 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
32	29, 31	eqtr4di 2814	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) = (◡(𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅))
33	11	toptopon 23215	. . . . . 6 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
34	33	biimpi 219	. . . . 5 ⊢ (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘∪ 𝐾))
35	34	ad2antlr 740	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → 𝐾 ∈ (TopOn‘∪ 𝐾))
36	10	toptopon 23215	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
37	36	biimpi 219	. . . . . 6 ⊢ (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
38	37	ad2antrr 739	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → 𝐽 ∈ (TopOn‘𝑋))
39		simprr 785	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → 𝐴 ∈ 𝑋)
40	35, 38, 39	cnmptc 23961	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ ∪ 𝐾 ↦ 𝐴) ∈ (𝐾 Cn 𝐽))
41	35	cnmptid 23960	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ ∪ 𝐾 ↦ 𝑦) ∈ (𝐾 Cn 𝐾))
42	35, 40, 41	cnmpt1t 23964	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)))
43		cnima 23563	. . 3 ⊢ (((𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)) ∧ 𝑅 ∈ (𝐽 ×t 𝐾)) → (◡(𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) ∈ 𝐾)
44	42, 6, 43	syl2anc 596	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (◡(𝑦 ∈ ∪ 𝐾 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) ∈ 𝐾)
45	32, 44	eqeltrd 2861	1 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ∈ (𝐽 ×t 𝐾) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) ∈ 𝐾)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   ⊆ wss 3899  {csn 4584  ⟨cop 4590  ∪ cuni 4867   ↦ cmpt 5186   × cxp 5649  ^◡ccnv 5650   “ cima 5654  ‘cfv 6531  (class class class)co 7412  Topctop 23191  TopOnctopon 23208   Cn ccn 23522   ×_t ctx 23859

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-map 8833  df-topgen 17594  df-top 23192  df-topon 23209  df-bases 23244  df-cn 23525  df-cnp 23526  df-tx 23861

This theorem is used by: (None)