Theorem icoreclin 38260

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 38257	. . 3 ⊢ (𝑦 ∈ 𝐼 ↔ ∃𝑐 ∈ ℝ ∃𝑑 ∈ ℝ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})
3	1	icoreelrnab 38257	. . . . . . 7 ⊢ (𝑥 ∈ 𝐼 ↔ ∃𝑎 ∈ ℝ ∃𝑏 ∈ ℝ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})
4	1	isbasisrelowllem1 38258	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
5	4	ex 418	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) → (𝑥 ∩ 𝑦) ∈ 𝐼))
6	1	isbasisrelowllem2 38259	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
7	6	ex 418	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏) → (𝑥 ∩ 𝑦) ∈ 𝐼))
8	5, 7	jaod 873	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼))
9		incom 4155	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∩ 𝑥) = (𝑥 ∩ 𝑦)
10	1	isbasisrelowllem2 38259	. . . . . . . . . . . . . . 15 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑)) → (𝑦 ∩ 𝑥) ∈ 𝐼)
11	9, 10	eqeltrrid 2866	. . . . . . . . . . . . . 14 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
12	11	ancom1s 666	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
13	12	ex 418	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) → (𝑥 ∩ 𝑦) ∈ 𝐼))
14	1	isbasisrelowllem1 38258	. . . . . . . . . . . . . . 15 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑦 ∩ 𝑥) ∈ 𝐼)
15	9, 14	eqeltrrid 2866	. . . . . . . . . . . . . 14 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
16	15	ancom1s 666	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
17	16	ex 418	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏) → (𝑥 ∩ 𝑦) ∈ 𝐼))
18	13, 17	jaod 873	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼))
19		3simpa 1166	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) → (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ))
20		3simpa 1166	. . . . . . . . . . . 12 ⊢ ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ))
21		letric 11403	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 ∈ ℝ ∧ 𝑐 ∈ ℝ) → (𝑎 ≤ 𝑐 ∨ 𝑐 ≤ 𝑎))
22		letric 11403	. . . . . . . . . . . . . . 15 ⊢ ((𝑏 ∈ ℝ ∧ 𝑑 ∈ ℝ) → (𝑏 ≤ 𝑑 ∨ 𝑑 ≤ 𝑏))
23	21, 22	anim12i 625	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ ℝ ∧ 𝑐 ∈ ℝ) ∧ (𝑏 ∈ ℝ ∧ 𝑑 ∈ ℝ)) → ((𝑎 ≤ 𝑐 ∨ 𝑐 ≤ 𝑎) ∧ (𝑏 ≤ 𝑑 ∨ 𝑑 ≤ 𝑏)))
24		anddi 1028	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ≤ 𝑐 ∨ 𝑐 ≤ 𝑎) ∧ (𝑏 ≤ 𝑑 ∨ 𝑑 ≤ 𝑏)) ↔ (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
25	23, 24	sylib 221	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ ℝ ∧ 𝑐 ∈ ℝ) ∧ (𝑏 ∈ ℝ ∧ 𝑑 ∈ ℝ)) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
26	25	an4s 673	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ)) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
27	19, 20, 26	syl2an 608	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
28	8, 18, 27	mpjaod 874	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (𝑥 ∩ 𝑦) ∈ 𝐼)
29	28	ex 418	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼))
30	29	3expia 1139	. . . . . . . 8 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) → (𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)} → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼)))
31	30	rexlimivv 3205	. . . . . . 7 ⊢ (∃𝑎 ∈ ℝ ∃𝑏 ∈ ℝ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)} → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼))
32	3, 31	sylbi 220	. . . . . 6 ⊢ (𝑥 ∈ 𝐼 → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼))
33	32	com12 33	. . . . 5 ⊢ ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼))
34	33	3expia 1139	. . . 4 ⊢ ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ) → (𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)} → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼)))
35	34	rexlimivv 3205	. . 3 ⊢ (∃𝑐 ∈ ℝ ∃𝑑 ∈ ℝ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)} → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼))
36	2, 35	sylbi 220	. 2 ⊢ (𝑦 ∈ 𝐼 → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼))
37	36	impcom 413	1 ⊢ ((𝑥 ∈ 𝐼 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∩ 𝑦) ∈ 𝐼)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  {crab 3413   ∩ cin 3898   class class class wbr 5103   × cxp 5649   “ cima 5654  ℝcr 11192   < clt 11336   ≤ cle 11337  [,)cico 13471

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 7749  ax-cnex 11249  ax-resscn 11250  ax-pre-lttri 11267  ax-pre-lttrn 11268

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  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-po 5559  df-so 5560  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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-er 8710  df-en 8967  df-dom 8968  df-sdom 8969  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-ico 13475

This theorem is used by:  isbasisrelowl  38261