iooiinioc - Mathbox for Glauco Siliprandi

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

Theorem iooiinioc 46394

Description: A left-open, right-closed interval expressed as the indexed intersection of open intervals. (Contributed by Glauco Siliprandi, 26-Jun-2021.)

**Hypotheses**
Ref	Expression
iooiinioc.1	⊢ (𝜑 → 𝐴 ∈ ℝ^*)
iooiinioc.2	⊢ (𝜑 → 𝐵 ∈ ℝ)

**Assertion**
Ref	Expression
iooiinioc	⊢ (𝜑 → ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) = (𝐴(,]𝐵))

Distinct variable groups: 𝐴,𝑛 𝐵,𝑛 𝜑,𝑛

Proof of Theorem iooiinioc Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iooiinioc.1	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
2	1	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝐴 ∈ ℝ^*)
3		iooiinioc.2	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ)
4	3	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝐵 ∈ ℝ)
5	4	rexrd 11287	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝐵 ∈ ℝ^*)
6		1nn 12272	. . . . . . . . . 10 ⊢ 1 ∈ ℕ
7		ioossre 13464	. . . . . . . . . 10 ⊢ (𝐴(,)(𝐵 + (1 / 1))) ⊆ ℝ
8		oveq2 7425	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 1 → (1 / 𝑛) = (1 / 1))
9	8	oveq2d 7433	. . . . . . . . . . . . 13 ⊢ (𝑛 = 1 → (𝐵 + (1 / 𝑛)) = (𝐵 + (1 / 1)))
10	9	oveq2d 7433	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → (𝐴(,)(𝐵 + (1 / 𝑛))) = (𝐴(,)(𝐵 + (1 / 1))))
11	10	sseq1d 3965	. . . . . . . . . . 11 ⊢ (𝑛 = 1 → ((𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ ℝ ↔ (𝐴(,)(𝐵 + (1 / 1))) ⊆ ℝ))
12	11	rspcev 3579	. . . . . . . . . 10 ⊢ ((1 ∈ ℕ ∧ (𝐴(,)(𝐵 + (1 / 1))) ⊆ ℝ) → ∃𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ ℝ)
13	6, 7, 12	mp2an 705	. . . . . . . . 9 ⊢ ∃𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ ℝ
14		iinss 5019	. . . . . . . . 9 ⊢ (∃𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ ℝ → ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ ℝ)
15	13, 14	ax-mp 5	. . . . . . . 8 ⊢ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ ℝ
16	15	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ ℝ)
17		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))))
18	16, 17	sseldd 3935	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝑥 ∈ ℝ)
19	18	rexrd 11287	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝑥 ∈ ℝ^*)
20		1red 11237	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℝ)
21		ax-1ne0 11197	. . . . . . . . . . 11 ⊢ 1 ≠ 0
22	21	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 1 ≠ 0)
23	20, 20, 22	redivcld 12071	. . . . . . . . 9 ⊢ (𝜑 → (1 / 1) ∈ ℝ)
24	3, 23	readdcld 11266	. . . . . . . 8 ⊢ (𝜑 → (𝐵 + (1 / 1)) ∈ ℝ)
25	24	rexrd 11287	. . . . . . 7 ⊢ (𝜑 → (𝐵 + (1 / 1)) ∈ ℝ^*)
26	25	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → (𝐵 + (1 / 1)) ∈ ℝ^*)
27		id 23	. . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) → 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))))
28	6	a1i 11	. . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) → 1 ∈ ℕ)
29	10	eleq2d 2848	. . . . . . . 8 ⊢ (𝑛 = 1 → (𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛))) ↔ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 1)))))
30	27, 28, 29	eliind 45913	. . . . . . 7 ⊢ (𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) → 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 1))))
31	30	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 1))))
32		ioogtlb 46333	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ (𝐵 + (1 / 1)) ∈ ℝ^* ∧ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 1)))) → 𝐴 < 𝑥)
33	2, 26, 31, 32	syl3anc 1398	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝐴 < 𝑥)
34		nfv 1947	. . . . . . . 8 ⊢ Ⅎ𝑛𝜑
35		nfcv 2924	. . . . . . . . 9 ⊢ Ⅎ𝑛𝑥
36		nfii1 4991	. . . . . . . . 9 ⊢ Ⅎ𝑛∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))
37	35, 36	nfel 2938	. . . . . . . 8 ⊢ Ⅎ𝑛 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))
38	34, 37	nfan 1932	. . . . . . 7 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))))
39		simpll 779	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → 𝜑)
40		iinss2 5020	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ (𝐴(,)(𝐵 + (1 / 𝑛))))
41	40	adantl 487	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ∧ 𝑛 ∈ ℕ) → ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ (𝐴(,)(𝐵 + (1 / 𝑛))))
42		simpl 488	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ∧ 𝑛 ∈ ℕ) → 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))))
43	41, 42	sseldd 3935	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ∧ 𝑛 ∈ ℕ) → 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛))))
44	43	adantll 727	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛))))
45		simpr 490	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ)
46		elioore 13432	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛))) → 𝑥 ∈ ℝ)
47	46	adantr 486	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛))) ∧ 𝑛 ∈ ℕ) → 𝑥 ∈ ℝ)
48	47	adantll 727	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → 𝑥 ∈ ℝ)
49	3	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐵 ∈ ℝ)
50		nnrecre 12306	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ)
51	50	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℝ)
52	49, 51	readdcld 11266	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐵 + (1 / 𝑛)) ∈ ℝ)
53	52	adantlr 728	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → (𝐵 + (1 / 𝑛)) ∈ ℝ)
54	1	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ ℝ^*)
55	54	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ ℝ^*)
56	52	rexrd 11287	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐵 + (1 / 𝑛)) ∈ ℝ^*)
57	56	adantlr 728	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → (𝐵 + (1 / 𝑛)) ∈ ℝ^*)
58		simplr 781	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛))))
59		iooltub 46348	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ (𝐵 + (1 / 𝑛)) ∈ ℝ^* ∧ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝑥 < (𝐵 + (1 / 𝑛)))
60	55, 57, 58, 59	syl3anc 1398	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → 𝑥 < (𝐵 + (1 / 𝑛)))
61	48, 53, 60	ltled 11386	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → 𝑥 ≤ (𝐵 + (1 / 𝑛)))
62	39, 44, 45, 61	syl21anc 851	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) ∧ 𝑛 ∈ ℕ) → 𝑥 ≤ (𝐵 + (1 / 𝑛)))
63	62	ex 418	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → (𝑛 ∈ ℕ → 𝑥 ≤ (𝐵 + (1 / 𝑛))))
64	38, 63	ralrimi 3262	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → ∀𝑛 ∈ ℕ 𝑥 ≤ (𝐵 + (1 / 𝑛)))
65	38, 19, 4	xrralrecnnle 46220	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → (𝑥 ≤ 𝐵 ↔ ∀𝑛 ∈ ℕ 𝑥 ≤ (𝐵 + (1 / 𝑛))))
66	64, 65	mpbird 260	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝑥 ≤ 𝐵)
67	2, 5, 19, 33, 66	eliocd 46345	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))) → 𝑥 ∈ (𝐴(,]𝐵))
68	67	ralrimiva 3156	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))𝑥 ∈ (𝐴(,]𝐵))
69		dfss3 3923	. . 3 ⊢ (∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ (𝐴(,]𝐵) ↔ ∀𝑥 ∈ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛)))𝑥 ∈ (𝐴(,]𝐵))
70	68, 69	sylibr 237	. 2 ⊢ (𝜑 → ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ⊆ (𝐴(,]𝐵))
71	1	xrleidd 13207	. . . . . 6 ⊢ (𝜑 → 𝐴 ≤ 𝐴)
72	71	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ≤ 𝐴)
73		1rp 13050	. . . . . . . . 9 ⊢ 1 ∈ ℝ⁺
74	73	a1i 11	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → 1 ∈ ℝ⁺)
75		nnrp 13058	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ⁺)
76	74, 75	rpdivcld 13107	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ⁺)
77	76	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℝ⁺)
78	49, 77	ltaddrpd 13123	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐵 < (𝐵 + (1 / 𝑛)))
79		iocssioo 13496	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ (𝐵 + (1 / 𝑛)) ∈ ℝ^*) ∧ (𝐴 ≤ 𝐴 ∧ 𝐵 < (𝐵 + (1 / 𝑛)))) → (𝐴(,]𝐵) ⊆ (𝐴(,)(𝐵 + (1 / 𝑛))))
80	54, 56, 72, 78, 79	syl22anc 852	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐴(,]𝐵) ⊆ (𝐴(,)(𝐵 + (1 / 𝑛))))
81	80	ralrimiva 3156	. . 3 ⊢ (𝜑 → ∀𝑛 ∈ ℕ (𝐴(,]𝐵) ⊆ (𝐴(,)(𝐵 + (1 / 𝑛))))
82		ssiin 5018	. . 3 ⊢ ((𝐴(,]𝐵) ⊆ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) ↔ ∀𝑛 ∈ ℕ (𝐴(,]𝐵) ⊆ (𝐴(,)(𝐵 + (1 / 𝑛))))
83	81, 82	sylibr 237	. 2 ⊢ (𝜑 → (𝐴(,]𝐵) ⊆ ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))))
84	70, 83	eqssd 3951	1 ⊢ (𝜑 → ∩ 𝑛 ∈ ℕ (𝐴(,)(𝐵 + (1 / 𝑛))) = (𝐴(,]𝐵))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∀wral 3078 ∃wrex 3088 ⊆ wss 3902 ∩ ciin 4955 class class class wbr 5107 (class class class)co 7417 ℝcr 11127 0cc0 11128 1c1 11129 + caddc 11131 ℝ^*cxr 11270 < clt 11271 ≤ cle 11272 / cdiv 11899 ℕcn 12261 ℝ⁺crp 13046 (,)cioo 13402 (,]cioc 13403

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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 ax-pre-sup 11206

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 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-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-sup 9416 df-inf 9417 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-div 11900 df-nn 12262 df-n0 12533 df-z 12620 df-uz 12892 df-q 13002 df-rp 13047 df-ioo 13406 df-ioc 13407 df-fl 13857

This theorem is used by: iocborel 47192

W3C validator