Theorem icoreclin 37358

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 37355	. . 3 ⊢ (𝑦 ∈ 𝐼 ↔ ∃𝑐 ∈ ℝ ∃𝑑 ∈ ℝ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})
3	1	icoreelrnab 37355	. . . . . . 7 ⊢ (𝑥 ∈ 𝐼 ↔ ∃𝑎 ∈ ℝ ∃𝑏 ∈ ℝ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})
4	1	isbasisrelowllem1 37356	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
5	4	ex 412	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) → (𝑥 ∩ 𝑦) ∈ 𝐼))
6	1	isbasisrelowllem2 37357	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
7	6	ex 412	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏) → (𝑥 ∩ 𝑦) ∈ 𝐼))
8	5, 7	jaod 860	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼))
9		incom 4209	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∩ 𝑥) = (𝑥 ∩ 𝑦)
10	1	isbasisrelowllem2 37357	. . . . . . . . . . . . . . 15 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑)) → (𝑦 ∩ 𝑥) ∈ 𝐼)
11	9, 10	eqeltrrid 2846	. . . . . . . . . . . . . 14 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
12	11	ancom1s 653	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
13	12	ex 412	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) → (𝑥 ∩ 𝑦) ∈ 𝐼))
14	1	isbasisrelowllem1 37356	. . . . . . . . . . . . . . 15 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑦 ∩ 𝑥) ∈ 𝐼)
15	9, 14	eqeltrrid 2846	. . . . . . . . . . . . . 14 ⊢ ((((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
16	15	ancom1s 653	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) ∧ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼)
17	16	ex 412	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → ((𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏) → (𝑥 ∩ 𝑦) ∈ 𝐼))
18	13, 17	jaod 860	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏)) → (𝑥 ∩ 𝑦) ∈ 𝐼))
19		3simpa 1149	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) → (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ))
20		3simpa 1149	. . . . . . . . . . . 12 ⊢ ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ))
21		letric 11361	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 ∈ ℝ ∧ 𝑐 ∈ ℝ) → (𝑎 ≤ 𝑐 ∨ 𝑐 ≤ 𝑎))
22		letric 11361	. . . . . . . . . . . . . . 15 ⊢ ((𝑏 ∈ ℝ ∧ 𝑑 ∈ ℝ) → (𝑏 ≤ 𝑑 ∨ 𝑑 ≤ 𝑏))
23	21, 22	anim12i 613	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ ℝ ∧ 𝑐 ∈ ℝ) ∧ (𝑏 ∈ ℝ ∧ 𝑑 ∈ ℝ)) → ((𝑎 ≤ 𝑐 ∨ 𝑐 ≤ 𝑎) ∧ (𝑏 ≤ 𝑑 ∨ 𝑑 ≤ 𝑏)))
24		anddi 1013	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ≤ 𝑐 ∨ 𝑐 ≤ 𝑎) ∧ (𝑏 ≤ 𝑑 ∨ 𝑑 ≤ 𝑏)) ↔ (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
25	23, 24	sylib 218	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ ℝ ∧ 𝑐 ∈ ℝ) ∧ (𝑏 ∈ ℝ ∧ 𝑑 ∈ ℝ)) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
26	25	an4s 660	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ)) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
27	19, 20, 26	syl2an 596	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (((𝑎 ≤ 𝑐 ∧ 𝑏 ≤ 𝑑) ∨ (𝑎 ≤ 𝑐 ∧ 𝑑 ≤ 𝑏)) ∨ ((𝑐 ≤ 𝑎 ∧ 𝑏 ≤ 𝑑) ∨ (𝑐 ≤ 𝑎 ∧ 𝑑 ≤ 𝑏))))
28	8, 18, 27	mpjaod 861	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) ∧ (𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)})) → (𝑥 ∩ 𝑦) ∈ 𝐼)
29	28	ex 412	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)}) → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼))
30	29	3expia 1122	. . . . . . . 8 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) → (𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)} → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼)))
31	30	rexlimivv 3201	. . . . . . 7 ⊢ (∃𝑎 ∈ ℝ ∃𝑏 ∈ ℝ 𝑥 = {𝑧 ∈ ℝ ∣ (𝑎 ≤ 𝑧 ∧ 𝑧 < 𝑏)} → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼))
32	3, 31	sylbi 217	. . . . . 6 ⊢ (𝑥 ∈ 𝐼 → ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∩ 𝑦) ∈ 𝐼))
33	32	com12 32	. . . . 5 ⊢ ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ ∧ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)}) → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼))
34	33	3expia 1122	. . . 4 ⊢ ((𝑐 ∈ ℝ ∧ 𝑑 ∈ ℝ) → (𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)} → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼)))
35	34	rexlimivv 3201	. . 3 ⊢ (∃𝑐 ∈ ℝ ∃𝑑 ∈ ℝ 𝑦 = {𝑧 ∈ ℝ ∣ (𝑐 ≤ 𝑧 ∧ 𝑧 < 𝑑)} → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼))
36	2, 35	sylbi 217	. 2 ⊢ (𝑦 ∈ 𝐼 → (𝑥 ∈ 𝐼 → (𝑥 ∩ 𝑦) ∈ 𝐼))
37	36	impcom 407	1 ⊢ ((𝑥 ∈ 𝐼 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∩ 𝑦) ∈ 𝐼)

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1540   ∈ wcel 2108  ∃wrex 3070  {crab 3436   ∩ cin 3950   class class class wbr 5143   × cxp 5683   “ cima 5688  ℝcr 11154   < clt 11295   ≤ cle 11296  [,)cico 13389

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 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-cnex 11211  ax-resscn 11212  ax-pre-lttri 11229  ax-pre-lttrn 11230

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-po 5592  df-so 5593  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8014  df-2nd 8015  df-er 8745  df-en 8986  df-dom 8987  df-sdom 8988  df-pnf 11297  df-mnf 11298  df-xr 11299  df-ltxr 11300  df-le 11301  df-ico 13393

This theorem is referenced by:  isbasisrelowl  37359