Theorem tmdcn2 23240

Description: Write out the definition of continuity of +_g explicitly. (Contributed by Mario Carneiro, 20-Sep-2015.)

Hypotheses

Ref	Expression
tmdcn2.1	⊢ 𝐵 = (Base‘𝐺)
tmdcn2.2	⊢ 𝐽 = (TopOpen‘𝐺)
tmdcn2.3	⊢ + = (+g‘𝐺)

Assertion

Ref	Expression
tmdcn2	⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ 𝑌 ∈ 𝑣 ∧ ∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (𝑥 + 𝑦) ∈ 𝑈))

Distinct variable groups:   𝑣,𝑢,𝑥,𝑦,𝐺   𝑢,𝐽,𝑣   𝑢,𝑈,𝑣,𝑥,𝑦   𝑢,𝑋,𝑣   𝑢,𝑌,𝑣

Allowed substitution hints:   𝐵(𝑥,𝑦,𝑣,𝑢)   + (𝑥,𝑦,𝑣,𝑢)   𝐽(𝑥,𝑦)   𝑋(𝑥,𝑦)   𝑌(𝑥,𝑦)

Proof of Theorem tmdcn2

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		tmdcn2.2	. . . . 5 ⊢ 𝐽 = (TopOpen‘𝐺)
2		tmdcn2.1	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
3	1, 2	tmdtopon 23232	. . . 4 ⊢ (𝐺 ∈ TopMnd → 𝐽 ∈ (TopOn‘𝐵))
4	3	ad2antrr 723	. . 3 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → 𝐽 ∈ (TopOn‘𝐵))
5		eqid 2738	. . . . . 6 ⊢ (+𝑓‘𝐺) = (+𝑓‘𝐺)
6	1, 5	tmdcn 23234	. . . . 5 ⊢ (𝐺 ∈ TopMnd → (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
7	6	ad2antrr 723	. . . 4 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
8		simpr1 1193	. . . . . 6 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → 𝑋 ∈ 𝐵)
9		simpr2 1194	. . . . . 6 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → 𝑌 ∈ 𝐵)
10	8, 9	opelxpd 5627	. . . . 5 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ⟨𝑋, 𝑌⟩ ∈ (𝐵 × 𝐵))
11		txtopon 22742	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝐵) ∧ 𝐽 ∈ (TopOn‘𝐵)) → (𝐽 ×t 𝐽) ∈ (TopOn‘(𝐵 × 𝐵)))
12	4, 4, 11	syl2anc 584	. . . . . 6 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝐽 ×t 𝐽) ∈ (TopOn‘(𝐵 × 𝐵)))
13		toponuni 22063	. . . . . 6 ⊢ ((𝐽 ×t 𝐽) ∈ (TopOn‘(𝐵 × 𝐵)) → (𝐵 × 𝐵) = ∪ (𝐽 ×t 𝐽))
14	12, 13	syl 17	. . . . 5 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝐵 × 𝐵) = ∪ (𝐽 ×t 𝐽))
15	10, 14	eleqtrd 2841	. . . 4 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ⟨𝑋, 𝑌⟩ ∈ ∪ (𝐽 ×t 𝐽))
16		eqid 2738	. . . . 5 ⊢ ∪ (𝐽 ×t 𝐽) = ∪ (𝐽 ×t 𝐽)
17	16	cncnpi 22429	. . . 4 ⊢ (((+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽) ∧ ⟨𝑋, 𝑌⟩ ∈ ∪ (𝐽 ×t 𝐽)) → (+𝑓‘𝐺) ∈ (((𝐽 ×t 𝐽) CnP 𝐽)‘⟨𝑋, 𝑌⟩))
18	7, 15, 17	syl2anc 584	. . 3 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (+𝑓‘𝐺) ∈ (((𝐽 ×t 𝐽) CnP 𝐽)‘⟨𝑋, 𝑌⟩))
19		simplr 766	. . 3 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → 𝑈 ∈ 𝐽)
20		tmdcn2.3	. . . . . 6 ⊢ + = (+g‘𝐺)
21	2, 20, 5	plusfval 18333	. . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(+𝑓‘𝐺)𝑌) = (𝑋 + 𝑌))
22	8, 9, 21	syl2anc 584	. . . 4 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝑋(+𝑓‘𝐺)𝑌) = (𝑋 + 𝑌))
23		simpr3 1195	. . . 4 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝑋 + 𝑌) ∈ 𝑈)
24	22, 23	eqeltrd 2839	. . 3 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝑋(+𝑓‘𝐺)𝑌) ∈ 𝑈)
25	4, 4, 18, 19, 8, 9, 24	txcnpi 22759	. 2 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ 𝑌 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡(+𝑓‘𝐺) “ 𝑈)))
26		dfss3 3909	. . . . . . 7 ⊢ ((𝑢 × 𝑣) ⊆ (◡(+𝑓‘𝐺) “ 𝑈) ↔ ∀𝑧 ∈ (𝑢 × 𝑣)𝑧 ∈ (◡(+𝑓‘𝐺) “ 𝑈))
27		eleq1 2826	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ (◡(+𝑓‘𝐺) “ 𝑈) ↔ ⟨𝑥, 𝑦⟩ ∈ (◡(+𝑓‘𝐺) “ 𝑈)))
28	2, 5	plusffn 18335	. . . . . . . . . 10 ⊢ (+𝑓‘𝐺) Fn (𝐵 × 𝐵)
29		elpreima 6935	. . . . . . . . . 10 ⊢ ((+𝑓‘𝐺) Fn (𝐵 × 𝐵) → (⟨𝑥, 𝑦⟩ ∈ (◡(+𝑓‘𝐺) “ 𝑈) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈)))
30	28, 29	ax-mp 5	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ (◡(+𝑓‘𝐺) “ 𝑈) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈))
31	27, 30	bitrdi 287	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ (◡(+𝑓‘𝐺) “ 𝑈) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈)))
32	31	ralxp 5750	. . . . . . 7 ⊢ (∀𝑧 ∈ (𝑢 × 𝑣)𝑧 ∈ (◡(+𝑓‘𝐺) “ 𝑈) ↔ ∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈))
33	26, 32	bitri 274	. . . . . 6 ⊢ ((𝑢 × 𝑣) ⊆ (◡(+𝑓‘𝐺) “ 𝑈) ↔ ∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈))
34		opelxp 5625	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))
35		df-ov 7278	. . . . . . . . . . 11 ⊢ (𝑥(+𝑓‘𝐺)𝑦) = ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩)
36	2, 20, 5	plusfval 18333	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+𝑓‘𝐺)𝑦) = (𝑥 + 𝑦))
37	35, 36	eqtr3id 2792	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) = (𝑥 + 𝑦))
38	34, 37	sylbi 216	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) = (𝑥 + 𝑦))
39	38	eleq1d 2823	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → (((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈 ↔ (𝑥 + 𝑦) ∈ 𝑈))
40	39	biimpa 477	. . . . . . 7 ⊢ ((⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈) → (𝑥 + 𝑦) ∈ 𝑈)
41	40	2ralimi 3088	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓‘𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈) → ∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (𝑥 + 𝑦) ∈ 𝑈)
42	33, 41	sylbi 216	. . . . 5 ⊢ ((𝑢 × 𝑣) ⊆ (◡(+𝑓‘𝐺) “ 𝑈) → ∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (𝑥 + 𝑦) ∈ 𝑈)
43	42	3anim3i 1153	. . . 4 ⊢ ((𝑋 ∈ 𝑢 ∧ 𝑌 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡(+𝑓‘𝐺) “ 𝑈)) → (𝑋 ∈ 𝑢 ∧ 𝑌 ∈ 𝑣 ∧ ∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (𝑥 + 𝑦) ∈ 𝑈))
44	43	reximi 3178	. . 3 ⊢ (∃𝑣 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ 𝑌 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡(+𝑓‘𝐺) “ 𝑈)) → ∃𝑣 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ 𝑌 ∈ 𝑣 ∧ ∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (𝑥 + 𝑦) ∈ 𝑈))
45	44	reximi 3178	. 2 ⊢ (∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ 𝑌 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ (◡(+𝑓‘𝐺) “ 𝑈)) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ 𝑌 ∈ 𝑣 ∧ ∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (𝑥 + 𝑦) ∈ 𝑈))
46	25, 45	syl 17	1 ⊢ (((𝐺 ∈ TopMnd ∧ 𝑈 ∈ 𝐽) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ∃𝑢 ∈ 𝐽 ∃𝑣 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ 𝑌 ∈ 𝑣 ∧ ∀𝑥 ∈ 𝑢 ∀𝑦 ∈ 𝑣 (𝑥 + 𝑦) ∈ 𝑈))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  ∀wral 3064  ∃wrex 3065   ⊆ wss 3887  ⟨cop 4567  ∪ cuni 4839   × cxp 5587  ^◡ccnv 5588   “ cima 5592   Fn wfn 6428  ‘cfv 6433  (class class class)co 7275  Basecbs 16912  +_gcplusg 16962  TopOpenctopn 17132  +_𝑓cplusf 18323  TopOnctopon 22059   Cn ccn 22375   CnP ccnp 22376   ×_t ctx 22711  TopMndctmd 23221

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-map 8617  df-topgen 17154  df-plusf 18325  df-top 22043  df-topon 22060  df-topsp 22082  df-bases 22096  df-cn 22378  df-cnp 22379  df-tx 22713  df-tmd 23223

This theorem is referenced by:  tsmsxp  23306