Theorem smfpimbor1lem1 47545

Description: Every open set belongs to 𝑇. This is the second step in the proof of Proposition 121E (f) of [Fremlin1] p. 38 . (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
smfpimbor1lem1.s	⊢ (𝜑 → 𝑆 ∈ SAlg)
smfpimbor1lem1.f	⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆))
smfpimbor1lem1.a	⊢ 𝐷 = dom 𝐹
smfpimbor1lem1.j	⊢ 𝐽 = (topGen‘ran (,))
smfpimbor1lem1.8	⊢ (𝜑 → 𝐺 ∈ 𝐽)
smfpimbor1lem1.t	⊢ 𝑇 = {𝑒 ∈ 𝒫 ℝ ∣ (◡𝐹 “ 𝑒) ∈ (𝑆 ↾t 𝐷)}

Assertion

Ref	Expression
smfpimbor1lem1	⊢ (𝜑 → 𝐺 ∈ 𝑇)

Distinct variable groups:   𝐷,𝑒   𝑒,𝐹   𝑆,𝑒   𝜑,𝑒

Allowed substitution hints:   𝑇(𝑒)   𝐺(𝑒)   𝐽(𝑒)

Proof of Theorem smfpimbor1lem1

Dummy variables 𝑞 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		smfpimbor1lem1.j	. . 3 ⊢ 𝐽 = (topGen‘ran (,))
2		smfpimbor1lem1.8	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐽)
3	1, 2	tgqioo2 46296	. 2 ⊢ (𝜑 → ∃𝑞(𝑞 ⊆ ((,) “ (ℚ × ℚ)) ∧ 𝐺 = ∪ 𝑞))
4		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝑞 ⊆ ((,) “ (ℚ × ℚ)) ∧ 𝐺 = ∪ 𝑞)) → 𝐺 = ∪ 𝑞)
5		smfpimbor1lem1.s	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ SAlg)
6		smfpimbor1lem1.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆))
7		smfpimbor1lem1.a	. . . . . . . . 9 ⊢ 𝐷 = dom 𝐹
8		smfpimbor1lem1.t	. . . . . . . . 9 ⊢ 𝑇 = {𝑒 ∈ 𝒫 ℝ ∣ (◡𝐹 “ 𝑒) ∈ (𝑆 ↾t 𝐷)}
9	5, 6, 7, 8	smfresal 47535	. . . . . . . 8 ⊢ (𝜑 → 𝑇 ∈ SAlg)
10	9	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑞 ⊆ ((,) “ (ℚ × ℚ))) → 𝑇 ∈ SAlg)
11		iooex 13406	. . . . . . . . . . . 12 ⊢ (,) ∈ V
12	11	imaexi 45970	. . . . . . . . . . 11 ⊢ ((,) “ (ℚ × ℚ)) ∈ V
13	12	a1i 11	. . . . . . . . . 10 ⊢ (𝑞 ⊆ ((,) “ (ℚ × ℚ)) → ((,) “ (ℚ × ℚ)) ∈ V)
14		id 23	. . . . . . . . . 10 ⊢ (𝑞 ⊆ ((,) “ (ℚ × ℚ)) → 𝑞 ⊆ ((,) “ (ℚ × ℚ)))
15	13, 14	ssexd 5297	. . . . . . . . 9 ⊢ (𝑞 ⊆ ((,) “ (ℚ × ℚ)) → 𝑞 ∈ V)
16	15	adantl 487	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑞 ⊆ ((,) “ (ℚ × ℚ))) → 𝑞 ∈ V)
17		simpr 490	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ⊆ ((,) “ (ℚ × ℚ))) → 𝑞 ⊆ ((,) “ (ℚ × ℚ)))
18		ioofun 46300	. . . . . . . . . . . . . . 15 ⊢ Fun (,)
19	18	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑞 ∈ ((,) “ (ℚ × ℚ)) → Fun (,))
20		id 23	. . . . . . . . . . . . . 14 ⊢ (𝑞 ∈ ((,) “ (ℚ × ℚ)) → 𝑞 ∈ ((,) “ (ℚ × ℚ)))
21		fvelima 6950	. . . . . . . . . . . . . 14 ⊢ ((Fun (,) ∧ 𝑞 ∈ ((,) “ (ℚ × ℚ))) → ∃𝑝 ∈ (ℚ × ℚ)((,)‘𝑝) = 𝑞)
22	19, 20, 21	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (𝑞 ∈ ((,) “ (ℚ × ℚ)) → ∃𝑝 ∈ (ℚ × ℚ)((,)‘𝑝) = 𝑞)
23	22	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ ((,) “ (ℚ × ℚ))) → ∃𝑝 ∈ (ℚ × ℚ)((,)‘𝑝) = 𝑞)
24		id 23	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((,)‘𝑝) = 𝑞 → ((,)‘𝑝) = 𝑞)
25	24	eqcomd 2771	. . . . . . . . . . . . . . . . . . 19 ⊢ (((,)‘𝑝) = 𝑞 → 𝑞 = ((,)‘𝑝))
26	25	adantl 487	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑝 ∈ (ℚ × ℚ) ∧ ((,)‘𝑝) = 𝑞) → 𝑞 = ((,)‘𝑝))
27		1st2nd2 8027	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑝 ∈ (ℚ × ℚ) → 𝑝 = ⟨(1st ‘𝑝), (2nd ‘𝑝)⟩)
28	27	fveq2d 6889	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑝 ∈ (ℚ × ℚ) → ((,)‘𝑝) = ((,)‘⟨(1st ‘𝑝), (2nd ‘𝑝)⟩))
29		df-ov 7419	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((1st ‘𝑝)(,)(2nd ‘𝑝)) = ((,)‘⟨(1st ‘𝑝), (2nd ‘𝑝)⟩)
30	29	eqcomi 2774	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((,)‘⟨(1st ‘𝑝), (2nd ‘𝑝)⟩) = ((1st ‘𝑝)(,)(2nd ‘𝑝))
31	30	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑝 ∈ (ℚ × ℚ) → ((,)‘⟨(1st ‘𝑝), (2nd ‘𝑝)⟩) = ((1st ‘𝑝)(,)(2nd ‘𝑝)))
32	28, 31	eqtrd 2800	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑝 ∈ (ℚ × ℚ) → ((,)‘𝑝) = ((1st ‘𝑝)(,)(2nd ‘𝑝)))
33	32	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑝 ∈ (ℚ × ℚ) ∧ ((,)‘𝑝) = 𝑞) → ((,)‘𝑝) = ((1st ‘𝑝)(,)(2nd ‘𝑝)))
34	26, 33	eqtrd 2800	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑝 ∈ (ℚ × ℚ) ∧ ((,)‘𝑝) = 𝑞) → 𝑞 = ((1st ‘𝑝)(,)(2nd ‘𝑝)))
35	34	3adant1 1148	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ) ∧ ((,)‘𝑝) = 𝑞) → 𝑞 = ((1st ‘𝑝)(,)(2nd ‘𝑝)))
36		ioossre 13445	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((1st ‘𝑝)(,)(2nd ‘𝑝)) ⊆ ℝ
37		ovex 7449	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((1st ‘𝑝)(,)(2nd ‘𝑝)) ∈ V
38	37	elpw 4568	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((1st ‘𝑝)(,)(2nd ‘𝑝)) ∈ 𝒫 ℝ ↔ ((1st ‘𝑝)(,)(2nd ‘𝑝)) ⊆ ℝ)
39	36, 38	mpbir 234	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((1st ‘𝑝)(,)(2nd ‘𝑝)) ∈ 𝒫 ℝ
40	39	a1i 11	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ)) → ((1st ‘𝑝)(,)(2nd ‘𝑝)) ∈ 𝒫 ℝ)
41	5	adantr 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ)) → 𝑆 ∈ SAlg)
42	6	adantr 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ)) → 𝐹 ∈ (SMblFn‘𝑆))
43		xp1st 8020	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑝 ∈ (ℚ × ℚ) → (1st ‘𝑝) ∈ ℚ)
44	43	qred 12990	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑝 ∈ (ℚ × ℚ) → (1st ‘𝑝) ∈ ℝ)
45	44	rexrd 11270	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑝 ∈ (ℚ × ℚ) → (1st ‘𝑝) ∈ ℝ*)
46	45	adantl 487	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ)) → (1st ‘𝑝) ∈ ℝ*)
47		xp2nd 8021	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑝 ∈ (ℚ × ℚ) → (2nd ‘𝑝) ∈ ℚ)
48	47	qred 12990	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑝 ∈ (ℚ × ℚ) → (2nd ‘𝑝) ∈ ℝ)
49	48	rexrd 11270	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑝 ∈ (ℚ × ℚ) → (2nd ‘𝑝) ∈ ℝ*)
50	49	adantl 487	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ)) → (2nd ‘𝑝) ∈ ℝ*)
51	41, 42, 7, 46, 50	smfpimioo 47534	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ)) → (◡𝐹 “ ((1st ‘𝑝)(,)(2nd ‘𝑝))) ∈ (𝑆 ↾t 𝐷))
52	40, 51	jca 521	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ)) → (((1st ‘𝑝)(,)(2nd ‘𝑝)) ∈ 𝒫 ℝ ∧ (◡𝐹 “ ((1st ‘𝑝)(,)(2nd ‘𝑝))) ∈ (𝑆 ↾t 𝐷)))
53		imaeq2 6060	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑒 = ((1st ‘𝑝)(,)(2nd ‘𝑝)) → (◡𝐹 “ 𝑒) = (◡𝐹 “ ((1st ‘𝑝)(,)(2nd ‘𝑝))))
54	53	eleq1d 2850	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑒 = ((1st ‘𝑝)(,)(2nd ‘𝑝)) → ((◡𝐹 “ 𝑒) ∈ (𝑆 ↾t 𝐷) ↔ (◡𝐹 “ ((1st ‘𝑝)(,)(2nd ‘𝑝))) ∈ (𝑆 ↾t 𝐷)))
55	54, 8	elrab2 3656	. . . . . . . . . . . . . . . . . 18 ⊢ (((1st ‘𝑝)(,)(2nd ‘𝑝)) ∈ 𝑇 ↔ (((1st ‘𝑝)(,)(2nd ‘𝑝)) ∈ 𝒫 ℝ ∧ (◡𝐹 “ ((1st ‘𝑝)(,)(2nd ‘𝑝))) ∈ (𝑆 ↾t 𝐷)))
56	52, 55	sylibr 237	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ)) → ((1st ‘𝑝)(,)(2nd ‘𝑝)) ∈ 𝑇)
57	56	3adant3 1150	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ) ∧ ((,)‘𝑝) = 𝑞) → ((1st ‘𝑝)(,)(2nd ‘𝑝)) ∈ 𝑇)
58	35, 57	eqeltrd 2865	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑝 ∈ (ℚ × ℚ) ∧ ((,)‘𝑝) = 𝑞) → 𝑞 ∈ 𝑇)
59	58	3exp 1137	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑝 ∈ (ℚ × ℚ) → (((,)‘𝑝) = 𝑞 → 𝑞 ∈ 𝑇)))
60	59	rexlimdv 3166	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∃𝑝 ∈ (ℚ × ℚ)((,)‘𝑝) = 𝑞 → 𝑞 ∈ 𝑇))
61	60	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ ((,) “ (ℚ × ℚ))) → (∃𝑝 ∈ (ℚ × ℚ)((,)‘𝑝) = 𝑞 → 𝑞 ∈ 𝑇))
62	23, 61	mpd 16	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ ((,) “ (ℚ × ℚ))) → 𝑞 ∈ 𝑇)
63	62	ssd 45833	. . . . . . . . . 10 ⊢ (𝜑 → ((,) “ (ℚ × ℚ)) ⊆ 𝑇)
64	63	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ⊆ ((,) “ (ℚ × ℚ))) → ((,) “ (ℚ × ℚ)) ⊆ 𝑇)
65	17, 64	sstrd 3948	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑞 ⊆ ((,) “ (ℚ × ℚ))) → 𝑞 ⊆ 𝑇)
66	16, 65	elpwd 4570	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑞 ⊆ ((,) “ (ℚ × ℚ))) → 𝑞 ∈ 𝒫 𝑇)
67		ssdomg 8999	. . . . . . . . . 10 ⊢ (((,) “ (ℚ × ℚ)) ∈ V → (𝑞 ⊆ ((,) “ (ℚ × ℚ)) → 𝑞 ≼ ((,) “ (ℚ × ℚ))))
68	12, 67	ax-mp 5	. . . . . . . . 9 ⊢ (𝑞 ⊆ ((,) “ (ℚ × ℚ)) → 𝑞 ≼ ((,) “ (ℚ × ℚ)))
69		qct 46111	. . . . . . . . . . . . 13 ⊢ ℚ ≼ ω
70	69, 69	pm3.2i 476	. . . . . . . . . . . 12 ⊢ (ℚ ≼ ω ∧ ℚ ≼ ω)
71		xpct 10012	. . . . . . . . . . . 12 ⊢ ((ℚ ≼ ω ∧ ℚ ≼ ω) → (ℚ × ℚ) ≼ ω)
72	70, 71	ax-mp 5	. . . . . . . . . . 11 ⊢ (ℚ × ℚ) ≼ ω
73		fimact 10530	. . . . . . . . . . 11 ⊢ (((ℚ × ℚ) ≼ ω ∧ Fun (,)) → ((,) “ (ℚ × ℚ)) ≼ ω)
74	72, 18, 73	mp2an 705	. . . . . . . . . 10 ⊢ ((,) “ (ℚ × ℚ)) ≼ ω
75	74	a1i 11	. . . . . . . . 9 ⊢ (𝑞 ⊆ ((,) “ (ℚ × ℚ)) → ((,) “ (ℚ × ℚ)) ≼ ω)
76		domtr 9006	. . . . . . . . 9 ⊢ ((𝑞 ≼ ((,) “ (ℚ × ℚ)) ∧ ((,) “ (ℚ × ℚ)) ≼ ω) → 𝑞 ≼ ω)
77	68, 75, 76	syl2anc 596	. . . . . . . 8 ⊢ (𝑞 ⊆ ((,) “ (ℚ × ℚ)) → 𝑞 ≼ ω)
78	77	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑞 ⊆ ((,) “ (ℚ × ℚ))) → 𝑞 ≼ ω)
79	10, 66, 78	salunicl 47063	. . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ⊆ ((,) “ (ℚ × ℚ))) → ∪ 𝑞 ∈ 𝑇)
80	79	adantrr 730	. . . . 5 ⊢ ((𝜑 ∧ (𝑞 ⊆ ((,) “ (ℚ × ℚ)) ∧ 𝐺 = ∪ 𝑞)) → ∪ 𝑞 ∈ 𝑇)
81	4, 80	eqeltrd 2865	. . . 4 ⊢ ((𝜑 ∧ (𝑞 ⊆ ((,) “ (ℚ × ℚ)) ∧ 𝐺 = ∪ 𝑞)) → 𝐺 ∈ 𝑇)
82	81	ex 418	. . 3 ⊢ (𝜑 → ((𝑞 ⊆ ((,) “ (ℚ × ℚ)) ∧ 𝐺 = ∪ 𝑞) → 𝐺 ∈ 𝑇))
83	82	exlimdv 1966	. 2 ⊢ (𝜑 → (∃𝑞(𝑞 ⊆ ((,) “ (ℚ × ℚ)) ∧ 𝐺 = ∪ 𝑞) → 𝐺 ∈ 𝑇))
84	3, 83	mpd 16	1 ⊢ (𝜑 → 𝐺 ∈ 𝑇)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2146  ∃wrex 3091  {crab 3418  Vcvv 3457   ⊆ wss 3906  𝒫 cpw 4564  ⟨cop 4597  ∪ cuni 4874   class class class wbr 5111   × cxp 5661  ^◡ccnv 5662  dom cdm 5663  ran crn 5664   “ cima 5666  Fun wfun 6534  ‘cfv 6540  (class class class)co 7416  ωcom 7864  1^st c1st 7986  2^nd c2nd 7987   ≼ cdom 8943  ℝcr 11110  ℝ^*cxr 11253  ℚcq 12983  (,)cioo 13383   ↾_t crest 17490  topGenctg 17507  SAlgcsalg 47055  SMblFncsmblfn 47442

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-inf2 9613  ax-cc 10430  ax-ac2 10458  ax-cnex 11167  ax-resscn 11168  ax-1cn 11169  ax-icn 11170  ax-addcl 11171  ax-addrcl 11172  ax-mulcl 11173  ax-mulrcl 11174  ax-mulcom 11175  ax-addass 11176  ax-mulass 11177  ax-distr 11178  ax-i2m1 11179  ax-1ne0 11180  ax-1rid 11181  ax-rnegex 11182  ax-rrecex 11183  ax-cnre 11184  ax-pre-lttri 11185  ax-pre-lttrn 11186  ax-pre-ltadd 11187  ax-pre-mulgt0 11188  ax-pre-sup 11189

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-iin 4961  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-2o 8456  df-oadd 8459  df-omul 8460  df-er 8696  df-map 8828  df-pm 8829  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-sup 9405  df-inf 9406  df-oi 9475  df-card 9937  df-acn 9940  df-ac 10112  df-pnf 11256  df-mnf 11257  df-xr 11258  df-ltxr 11259  df-le 11260  df-sub 11454  df-neg 11455  df-div 11883  df-nn 12245  df-n0 12516  df-z 12603  df-uz 12874  df-q 12984  df-rp 13028  df-ioo 13387  df-ico 13389  df-fl 13838  df-rest 17492  df-topgen 17513  df-bases 23132  df-salg 47056  df-smblfn 47443

This theorem is used by:  smfpimbor1lem2  47546