Theorem icoreclin 34642

Description: The set of closed-below, open-above intervals of reals is closed under finite intersection. (Contributed by ML, 27-Jul-2020.)

Hypothesis

Ref	Expression
isbasisrelowl.1	⊢ 𝐼 = ([,) “ (ℝ × ℝ))

Assertion

Ref	Expression
icoreclin	⊢ ((𝑥 ∈ 𝐼 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∩ 𝑦) ∈ 𝐼)

Distinct variable group:   𝑥,𝐼,𝑦

Proof of Theorem icoreclin

Dummy variables 𝑧 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isbasisrelowl.1	. . . 4 ⊢ 𝐼 = ([,) “ (ℝ × ℝ))
2	1	icoreelrnab 34639	. . 3 ⊢ (𝑦 ∈ 𝐼 ↔ ∃𝑐 ∈ ℝ ∃𝑑 ∈ ℝ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})
3	1	icoreelrnab 34639	. . . . . . 7 ⊢ (𝑥 ∈ 𝐼 ↔ ∃𝑎 ∈ ℝ ∃𝑏 ∈ ℝ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})
4	1	isbasisrelowllem1 34640	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
5	4	ex 415	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) → (𝑥 ∩ 𝑦) ∈ 𝐼))
6	1	isbasisrelowllem2 34641	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
7	6	ex 415	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏) → (𝑥 ∩ 𝑦) ∈ 𝐼))
8	5, 7	jaod 855	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼))
9		incom 4181	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∩ 𝑥) = (𝑥 ∩ 𝑦)
10	1	isbasisrelowllem2 34641	. . . . . . . . . . . . . . 15 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑)) → (𝑦 ∩ 𝑥) ∈ 𝐼)
11	9, 10	eqeltrrid 2921	. . . . . . . . . . . . . 14 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
12	11	ancom1s 651	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
13	12	ex 415	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) → (𝑥 ∩ 𝑦) ∈ 𝐼))
14	1	isbasisrelowllem1 34640	. . . . . . . . . . . . . . 15 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑦 ∩ 𝑥) ∈ 𝐼)
15	9, 14	eqeltrrid 2921	. . . . . . . . . . . . . 14 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
16	15	ancom1s 651	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
17	16	ex 415	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏) → (𝑥 ∩ 𝑦) ∈ 𝐼))
18	13, 17	jaod 855	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼))
19		3simpa 1144	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) → (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ))
20		3simpa 1144	. . . . . . . . . . . 12 ⊢ ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ))
21		letric 10743	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 ∈ ℝ ∧ 𝑐 ∈ ℝ) → (𝑎 ≤ 𝑐 ∨ 𝑐 ≤ 𝑎))
22		letric 10743	. . . . . . . . . . . . . . 15 ⊢ ((𝑏 ∈ ℝ ∧ 𝑑 ∈ ℝ) → (𝑏 ≤ 𝑑 ∨ 𝑑 ≤ 𝑏))
23	21, 22	anim12i 614	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ ℝ ∧ 𝑐 ∈ ℝ) ∧ (𝑏 ∈ ℝ ∧ 𝑑 ∈ ℝ)) → ((𝑎 ≤ 𝑐 ∨ 𝑐 ≤ 𝑎) ∧ (𝑏 ≤ 𝑑 ∨ 𝑑 ≤ 𝑏)))
24		anddi 1007	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ≤ 𝑐 ∨ 𝑐 ≤ 𝑎) ∧ (𝑏 ≤ 𝑑 ∨ 𝑑 ≤ 𝑏)) ↔ (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
25	23, 24	sylib 220	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ ℝ ∧ 𝑐 ∈ ℝ) ∧ (𝑏 ∈ ℝ ∧ 𝑑 ∈ ℝ)) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
26	25	an4s 658	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ)) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
27	19, 20, 26	syl2an 597	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
28	8, 18, 27	mpjaod 856	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (𝑥 ∩ 𝑦) ∈ 𝐼)
29	28	ex 415	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼))
30	29	3expia 1117	. . . . . . . 8 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) → (𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)} → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼)))
31	30	rexlimivv 3295	. . . . . . 7 ⊢ (∃𝑎 ∈ ℝ ∃𝑏 ∈ ℝ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)} → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼))
32	3, 31	sylbi 219	. . . . . 6 ⊢ (𝑥 ∈ 𝐼 → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼))
33	32	com12 32	. . . . 5 ⊢ ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼))
34	33	3expia 1117	. . . 4 ⊢ ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ) → (𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)} → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼)))
35	34	rexlimivv 3295	. . 3 ⊢ (∃𝑐 ∈ ℝ ∃𝑑 ∈ ℝ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)} → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼))
36	2, 35	sylbi 219	. 2 ⊢ (𝑦 ∈ 𝐼 → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼))
37	36	impcom 410	1 ⊢ ((𝑥 ∈ 𝐼 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∩ 𝑦) ∈ 𝐼)

Syntax hints:   → wi 4   ∧ wa 398   ∨ wo 843   ∧ w3a 1083   = wceq 1536   ∈ wcel 2113  ∃wrex 3142  {crab 3145   ∩ cin 3938   class class class wbr 5069   × cxp 5556   “ cima 5561  ℝcr 10539   < clt 10678   ≤ cle 10679  [,)cico 12743

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464  ax-cnex 10596  ax-resscn 10597  ax-pre-lttri 10614  ax-pre-lttrn 10615

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-nel 3127  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-po 5477  df-so 5478  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-ov 7162  df-oprab 7163  df-mpo 7164  df-1st 7692  df-2nd 7693  df-er 8292  df-en 8513  df-dom 8514  df-sdom 8515  df-pnf 10680  df-mnf 10681  df-xr 10682  df-ltxr 10683  df-le 10684  df-ico 12747

This theorem is referenced by:  isbasisrelowl  34643