lptioo2 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lptioo2		Structured version Visualization version GIF version

Theorem lptioo2 45048

Description: The upper bound of an open interval is a limit point of the interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
lptioo2.1	⊢ 𝐽 = (topGen‘ran (,))
lptioo2.2	⊢ (𝜑 → 𝐴 ∈ ℝ^*)
lptioo2.3	⊢ (𝜑 → 𝐵 ∈ ℝ)
lptioo2.4	⊢ (𝜑 → 𝐴 < 𝐵)

**Assertion**
Ref	Expression
lptioo2	⊢ (𝜑 → 𝐵 ∈ ((limPt‘𝐽)‘(𝐴(,)𝐵)))

Proof of Theorem lptioo2 Dummy variables 𝑎 𝑏 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		difssd 4133	. . . . . . . 8 ⊢ (𝜑 → ((𝐴(,)𝐵) ∖ {𝐵}) ⊆ (𝐴(,)𝐵))
2		simpr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝑥 ∈ (𝐴(,)𝐵))
3		ubioo 13396	. . . . . . . . . . . 12 ⊢ ¬ 𝐵 ∈ (𝐴(,)𝐵)
4		eleq1 2817	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ (𝐴(,)𝐵) ↔ 𝐵 ∈ (𝐴(,)𝐵)))
5	4	biimpcd 248	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝑥 = 𝐵 → 𝐵 ∈ (𝐴(,)𝐵)))
6	3, 5	mtoi 198	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → ¬ 𝑥 = 𝐵)
7	6	adantl 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → ¬ 𝑥 = 𝐵)
8		velsn 4648	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵)
9	7, 8	sylnibr 328	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → ¬ 𝑥 ∈ {𝐵})
10	2, 9	eldifd 3960	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝑥 ∈ ((𝐴(,)𝐵) ∖ {𝐵}))
11	1, 10	eqelssd 4003	. . . . . . 7 ⊢ (𝜑 → ((𝐴(,)𝐵) ∖ {𝐵}) = (𝐴(,)𝐵))
12	11	ineq2d 4214	. . . . . 6 ⊢ (𝜑 → ((𝑎(,)𝑏) ∩ ((𝐴(,)𝐵) ∖ {𝐵})) = ((𝑎(,)𝑏) ∩ (𝐴(,)𝐵)))
13	12	ad2antrr 724	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → ((𝑎(,)𝑏) ∩ ((𝐴(,)𝐵) ∖ {𝐵})) = ((𝑎(,)𝑏) ∩ (𝐴(,)𝐵)))
14		simplrl 775	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → 𝑎 ∈ ℝ^)
15		simplrr 776	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → 𝑏 ∈ ℝ^)
16		lptioo2.2	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
17	16	ad2antrr 724	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → 𝐴 ∈ ℝ^)
18		elioo3g 13393	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (𝑎(,)𝑏) ↔ ((𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (𝑎 < 𝐵 ∧ 𝐵 < 𝑏)))
19	18	biimpi 215	. . . . . . . . . 10 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → ((𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (𝑎 < 𝐵 ∧ 𝐵 < 𝑏)))
20	19	simpld 493	. . . . . . . . 9 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
21	20	simp3d 1141	. . . . . . . 8 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → 𝐵 ∈ ℝ^*)
22	21	adantl 480	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → 𝐵 ∈ ℝ^)
23		iooin 13398	. . . . . . 7 ⊢ (((𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^) ∧ (𝐴 ∈ ℝ^ ∧ 𝐵 ∈ ℝ^*)) → ((𝑎(,)𝑏) ∩ (𝐴(,)𝐵)) = (if(𝑎 ≤ 𝐴, 𝐴, 𝑎)(,)if(𝑏 ≤ 𝐵, 𝑏, 𝐵)))
24	14, 15, 17, 22, 23	syl22anc 837	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → ((𝑎(,)𝑏) ∩ (𝐴(,)𝐵)) = (if(𝑎 ≤ 𝐴, 𝐴, 𝑎)(,)if(𝑏 ≤ 𝐵, 𝑏, 𝐵)))
25		iftrue 4538	. . . . . . . . . . 11 ⊢ (𝑎 ≤ 𝐴 → if(𝑎 ≤ 𝐴, 𝐴, 𝑎) = 𝐴)
26	25	adantl 480	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) ∧ 𝑎 ≤ 𝐴) → if(𝑎 ≤ 𝐴, 𝐴, 𝑎) = 𝐴)
27		lptioo2.4	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 < 𝐵)
28	27	ad3antrrr 728	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) ∧ 𝑎 ≤ 𝐴) → 𝐴 < 𝐵)
29	26, 28	eqbrtrd 5174	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) ∧ 𝑎 ≤ 𝐴) → if(𝑎 ≤ 𝐴, 𝐴, 𝑎) < 𝐵)
30		iffalse 4541	. . . . . . . . . . 11 ⊢ (¬ 𝑎 ≤ 𝐴 → if(𝑎 ≤ 𝐴, 𝐴, 𝑎) = 𝑎)
31	30	adantl 480	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) ∧ ¬ 𝑎 ≤ 𝐴) → if(𝑎 ≤ 𝐴, 𝐴, 𝑎) = 𝑎)
32	19	simprd 494	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → (𝑎 < 𝐵 ∧ 𝐵 < 𝑏))
33	32	simpld 493	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → 𝑎 < 𝐵)
34	33	ad2antlr 725	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) ∧ ¬ 𝑎 ≤ 𝐴) → 𝑎 < 𝐵)
35	31, 34	eqbrtrd 5174	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) ∧ ¬ 𝑎 ≤ 𝐴) → if(𝑎 ≤ 𝐴, 𝐴, 𝑎) < 𝐵)
36	29, 35	pm2.61dan 811	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → if(𝑎 ≤ 𝐴, 𝐴, 𝑎) < 𝐵)
37	32	simprd 494	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → 𝐵 < 𝑏)
38	20	simp2d 1140	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → 𝑏 ∈ ℝ^*)
39		xrltnle 11319	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*) → (𝐵 < 𝑏 ↔ ¬ 𝑏 ≤ 𝐵))
40	21, 38, 39	syl2anc 582	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → (𝐵 < 𝑏 ↔ ¬ 𝑏 ≤ 𝐵))
41	37, 40	mpbid 231	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → ¬ 𝑏 ≤ 𝐵)
42		iffalse 4541	. . . . . . . . . . 11 ⊢ (¬ 𝑏 ≤ 𝐵 → if(𝑏 ≤ 𝐵, 𝑏, 𝐵) = 𝐵)
43	41, 42	syl 17	. . . . . . . . . 10 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → if(𝑏 ≤ 𝐵, 𝑏, 𝐵) = 𝐵)
44	43	eqcomd 2734	. . . . . . . . 9 ⊢ (𝐵 ∈ (𝑎(,)𝑏) → 𝐵 = if(𝑏 ≤ 𝐵, 𝑏, 𝐵))
45	44	adantl 480	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → 𝐵 = if(𝑏 ≤ 𝐵, 𝑏, 𝐵))
46	36, 45	breqtrd 5178	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → if(𝑎 ≤ 𝐴, 𝐴, 𝑎) < if(𝑏 ≤ 𝐵, 𝑏, 𝐵))
47	17, 14	ifcld 4578	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → if(𝑎 ≤ 𝐴, 𝐴, 𝑎) ∈ ℝ^)
48	45, 22	eqeltrrd 2830	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → if(𝑏 ≤ 𝐵, 𝑏, 𝐵) ∈ ℝ^)
49		ioon0 13390	. . . . . . . 8 ⊢ ((if(𝑎 ≤ 𝐴, 𝐴, 𝑎) ∈ ℝ^* ∧ if(𝑏 ≤ 𝐵, 𝑏, 𝐵) ∈ ℝ^*) → ((if(𝑎 ≤ 𝐴, 𝐴, 𝑎)(,)if(𝑏 ≤ 𝐵, 𝑏, 𝐵)) ≠ ∅ ↔ if(𝑎 ≤ 𝐴, 𝐴, 𝑎) < if(𝑏 ≤ 𝐵, 𝑏, 𝐵)))
50	47, 48, 49	syl2anc 582	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → ((if(𝑎 ≤ 𝐴, 𝐴, 𝑎)(,)if(𝑏 ≤ 𝐵, 𝑏, 𝐵)) ≠ ∅ ↔ if(𝑎 ≤ 𝐴, 𝐴, 𝑎) < if(𝑏 ≤ 𝐵, 𝑏, 𝐵)))
51	46, 50	mpbird 256	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → (if(𝑎 ≤ 𝐴, 𝐴, 𝑎)(,)if(𝑏 ≤ 𝐵, 𝑏, 𝐵)) ≠ ∅)
52	24, 51	eqnetrd 3005	. . . . 5 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → ((𝑎(,)𝑏) ∩ (𝐴(,)𝐵)) ≠ ∅)
53	13, 52	eqnetrd 3005	. . . 4 ⊢ (((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) ∧ 𝐵 ∈ (𝑎(,)𝑏)) → ((𝑎(,)𝑏) ∩ ((𝐴(,)𝐵) ∖ {𝐵})) ≠ ∅)
54	53	ex 411	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ ℝ^* ∧ 𝑏 ∈ ℝ^*)) → (𝐵 ∈ (𝑎(,)𝑏) → ((𝑎(,)𝑏) ∩ ((𝐴(,)𝐵) ∖ {𝐵})) ≠ ∅))
55	54	ralrimivva 3198	. 2 ⊢ (𝜑 → ∀𝑎 ∈ ℝ^* ∀𝑏 ∈ ℝ^* (𝐵 ∈ (𝑎(,)𝑏) → ((𝑎(,)𝑏) ∩ ((𝐴(,)𝐵) ∖ {𝐵})) ≠ ∅))
56		lptioo2.1	. . 3 ⊢ 𝐽 = (topGen‘ran (,))
57		ioossre 13425	. . . 4 ⊢ (𝐴(,)𝐵) ⊆ ℝ
58	57	a1i 11	. . 3 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ)
59		lptioo2.3	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ)
60	56, 58, 59	islptre 45036	. 2 ⊢ (𝜑 → (𝐵 ∈ ((limPt‘𝐽)‘(𝐴(,)𝐵)) ↔ ∀𝑎 ∈ ℝ^* ∀𝑏 ∈ ℝ^* (𝐵 ∈ (𝑎(,)𝑏) → ((𝑎(,)𝑏) ∩ ((𝐴(,)𝐵) ∖ {𝐵})) ≠ ∅)))
61	55, 60	mpbird 256	1 ⊢ (𝜑 → 𝐵 ∈ ((limPt‘𝐽)‘(𝐴(,)𝐵)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2937 ∀wral 3058 ∖ cdif 3946 ∩ cin 3948 ⊆ wss 3949 ∅c0 4326 ifcif 4532 {csn 4632 class class class wbr 5152 ran crn 5683 ‘cfv 6553 (class class class)co 7426 ℝcr 11145 ℝ^*cxr 11285 < clt 11286 ≤ cle 11287 (,)cioo 13364 topGenctg 17426 limPtclp 23058

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-rep 5289 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 ax-pre-sup 11224

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-int 4954 df-iun 5002 df-iin 5003 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-sup 9473 df-inf 9474 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-div 11910 df-nn 12251 df-n0 12511 df-z 12597 df-uz 12861 df-q 12971 df-ioo 13368 df-topgen 17432 df-top 22816 df-topon 22833 df-bases 22869 df-cld 22943 df-ntr 22944 df-cls 22945 df-nei 23022 df-lp 23060

This theorem is referenced by: lptioo2cn 45062 fouriersw 45648

W3C validator