Theorem rpnnen1lem5 12908

Description: Lemma for rpnnen1 12910. (Contributed by Mario Carneiro, 12-May-2013.) (Revised by NM, 13-Aug-2021.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
rpnnen1lem.1	⊢ 𝑇 = {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥}
rpnnen1lem.2	⊢ 𝐹 = (𝑥 ∈ ℝ ↦ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
rpnnen1lem.n	⊢ ℕ ∈ V
rpnnen1lem.q	⊢ ℚ ∈ V

Assertion

Ref	Expression
rpnnen1lem5	⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) = 𝑥)

Distinct variable groups:   𝑘,𝐹,𝑛,𝑥   𝑇,𝑛

Allowed substitution hints:   𝑇(𝑥,𝑘)

Proof of Theorem rpnnen1lem5

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rpnnen1lem.1	. . . 4 ⊢ 𝑇 = {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥}
2		rpnnen1lem.2	. . . 4 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
3		rpnnen1lem.n	. . . 4 ⊢ ℕ ∈ V
4		rpnnen1lem.q	. . . 4 ⊢ ℚ ∈ V
5	1, 2, 3, 4	rpnnen1lem3 12906	. . 3 ⊢ (𝑥 ∈ ℝ → ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥)
6	1, 2, 3, 4	rpnnen1lem1 12905	. . . . . 6 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥) ∈ (ℚ ↑m ℕ))
7	4, 3	elmap 8823	. . . . . 6 ⊢ ((𝐹‘𝑥) ∈ (ℚ ↑m ℕ) ↔ (𝐹‘𝑥):ℕ⟶ℚ)
8	6, 7	sylib 218	. . . . 5 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥):ℕ⟶ℚ)
9		frn 6679	. . . . . 6 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → ran (𝐹‘𝑥) ⊆ ℚ)
10		qssre 12886	. . . . . 6 ⊢ ℚ ⊆ ℝ
11	9, 10	sstrdi 3948	. . . . 5 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → ran (𝐹‘𝑥) ⊆ ℝ)
12	8, 11	syl 17	. . . 4 ⊢ (𝑥 ∈ ℝ → ran (𝐹‘𝑥) ⊆ ℝ)
13		1nn 12170	. . . . . . . 8 ⊢ 1 ∈ ℕ
14	13	ne0ii 4298	. . . . . . 7 ⊢ ℕ ≠ ∅
15		fdm 6681	. . . . . . . 8 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → dom (𝐹‘𝑥) = ℕ)
16	15	neeq1d 2992	. . . . . . 7 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → (dom (𝐹‘𝑥) ≠ ∅ ↔ ℕ ≠ ∅))
17	14, 16	mpbiri 258	. . . . . 6 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → dom (𝐹‘𝑥) ≠ ∅)
18		dm0rn0 5883	. . . . . . 7 ⊢ (dom (𝐹‘𝑥) = ∅ ↔ ran (𝐹‘𝑥) = ∅)
19	18	necon3bii 2985	. . . . . 6 ⊢ (dom (𝐹‘𝑥) ≠ ∅ ↔ ran (𝐹‘𝑥) ≠ ∅)
20	17, 19	sylib 218	. . . . 5 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → ran (𝐹‘𝑥) ≠ ∅)
21	8, 20	syl 17	. . . 4 ⊢ (𝑥 ∈ ℝ → ran (𝐹‘𝑥) ≠ ∅)
22		breq2 5104	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝑛 ≤ 𝑦 ↔ 𝑛 ≤ 𝑥))
23	22	ralbidv 3161	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦 ↔ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥))
24	23	rspcev 3578	. . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦)
25	5, 24	mpdan 688	. . . 4 ⊢ (𝑥 ∈ ℝ → ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦)
26		id 22	. . . 4 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ)
27		suprleub 12122	. . . 4 ⊢ (((ran (𝐹‘𝑥) ⊆ ℝ ∧ ran (𝐹‘𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦) ∧ 𝑥 ∈ ℝ) → (sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥))
28	12, 21, 25, 26, 27	syl31anc 1376	. . 3 ⊢ (𝑥 ∈ ℝ → (sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥))
29	5, 28	mpbird 257	. 2 ⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥)
30	1, 2, 3, 4	rpnnen1lem4 12907	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ)
31		resubcl 11459	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ) → (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ)
32	30, 31	mpdan 688	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ)
33	32	adantr 480	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ)
34		posdif 11644	. . . . . . . . . 10 ⊢ ((sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 ↔ 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
35	30, 34	mpancom 689	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 ↔ 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
36	35	biimpa 476	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )))
37	36	gt0ne0d 11715	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ≠ 0)
38	33, 37	rereccld 11982	. . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) ∈ ℝ)
39		arch 12412	. . . . . 6 ⊢ ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) ∈ ℝ → ∃𝑘 ∈ ℕ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘)
40	38, 39	syl 17	. . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → ∃𝑘 ∈ ℕ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘)
41	40	ex 412	. . . 4 ⊢ (𝑥 ∈ ℝ → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 → ∃𝑘 ∈ ℕ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘))
42	1, 2	rpnnen1lem2 12904	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(𝑇, ℝ, < ) ∈ ℤ)
43	42	zred 12610	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(𝑇, ℝ, < ) ∈ ℝ)
44	43	3adant3 1133	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘) → sup(𝑇, ℝ, < ) ∈ ℝ)
45	44	ltp1d 12086	. . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘) → sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1))
46	33, 36	jca 511	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → ((𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ ∧ 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
47		nnre 12166	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℝ)
48		nngt0 12190	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ → 0 < 𝑘)
49	47, 48	jca 511	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → (𝑘 ∈ ℝ ∧ 0 < 𝑘))
50		ltrec1 12043	. . . . . . . . . . . . 13 ⊢ ((((𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ ∧ 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) ∧ (𝑘 ∈ ℝ ∧ 0 < 𝑘)) → ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 ↔ (1 / 𝑘) < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
51	46, 49, 50	syl2an 597	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 ↔ (1 / 𝑘) < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
52	30	ad2antrr 727	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ)
53		nnrecre 12201	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ → (1 / 𝑘) ∈ ℝ)
54	53	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ)
55		simpll 767	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → 𝑥 ∈ ℝ)
56	52, 54, 55	ltaddsub2d 11752	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 ↔ (1 / 𝑘) < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
57	12	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ran (𝐹‘𝑥) ⊆ ℝ)
58		ffn 6672	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → (𝐹‘𝑥) Fn ℕ)
59	8, 58	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥) Fn ℕ)
60		fnfvelrn 7036	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹‘𝑥) Fn ℕ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) ∈ ran (𝐹‘𝑥))
61	59, 60	sylan 581	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) ∈ ran (𝐹‘𝑥))
62	57, 61	sseldd 3936	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) ∈ ℝ)
63	30	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ)
64	53	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ)
65	12, 21, 25	3jca 1129	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (ran (𝐹‘𝑥) ⊆ ℝ ∧ ran (𝐹‘𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦))
66	65	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (ran (𝐹‘𝑥) ⊆ ℝ ∧ ran (𝐹‘𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦))
67		suprub 12117	. . . . . . . . . . . . . . . . 17 ⊢ (((ran (𝐹‘𝑥) ⊆ ℝ ∧ ran (𝐹‘𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦) ∧ ((𝐹‘𝑥)‘𝑘) ∈ ran (𝐹‘𝑥)) → ((𝐹‘𝑥)‘𝑘) ≤ sup(ran (𝐹‘𝑥), ℝ, < ))
68	66, 61, 67	syl2anc 585	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) ≤ sup(ran (𝐹‘𝑥), ℝ, < ))
69	62, 63, 64, 68	leadd1dd 11765	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)))
70	62, 64	readdcld 11175	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ∈ ℝ)
71		readdcl 11123	. . . . . . . . . . . . . . . . 17 ⊢ ((sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ ∧ (1 / 𝑘) ∈ ℝ) → (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ)
72	30, 53, 71	syl2an 597	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ)
73		simpl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 𝑥 ∈ ℝ)
74		lelttr 11237	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ∈ ℝ ∧ (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (((((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) ∧ (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥) → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
75	74	expd 415	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ∈ ℝ ∧ (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) → ((sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥)))
76	70, 72, 73, 75	syl3anc 1374	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) → ((sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥)))
77	69, 76	mpd 15	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
78	77	adantlr 716	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
79	56, 78	sylbird 260	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((1 / 𝑘) < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
80	51, 79	sylbid 240	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
81	42	peano2zd 12613	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (sup(𝑇, ℝ, < ) + 1) ∈ ℤ)
82		oveq1 7377	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = (sup(𝑇, ℝ, < ) + 1) → (𝑛 / 𝑘) = ((sup(𝑇, ℝ, < ) + 1) / 𝑘))
83	82	breq1d 5110	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = (sup(𝑇, ℝ, < ) + 1) → ((𝑛 / 𝑘) < 𝑥 ↔ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥))
84	83, 1	elrab2 3651	. . . . . . . . . . . . . . . . 17 ⊢ ((sup(𝑇, ℝ, < ) + 1) ∈ 𝑇 ↔ ((sup(𝑇, ℝ, < ) + 1) ∈ ℤ ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥))
85	84	biimpri 228	. . . . . . . . . . . . . . . 16 ⊢ (((sup(𝑇, ℝ, < ) + 1) ∈ ℤ ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥) → (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇)
86	81, 85	sylan 581	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥) → (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇)
87		ssrab2 4034	. . . . . . . . . . . . . . . . . . . 20 ⊢ {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ⊆ ℤ
88	1, 87	eqsstri 3982	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝑇 ⊆ ℤ
89		zssre 12509	. . . . . . . . . . . . . . . . . . 19 ⊢ ℤ ⊆ ℝ
90	88, 89	sstri 3945	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑇 ⊆ ℝ
91	90	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 𝑇 ⊆ ℝ)
92		remulcl 11125	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑘 · 𝑥) ∈ ℝ)
93	92	ancoms 458	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℝ) → (𝑘 · 𝑥) ∈ ℝ)
94	47, 93	sylan2 594	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (𝑘 · 𝑥) ∈ ℝ)
95		btwnz 12609	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 · 𝑥) ∈ ℝ → (∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥) ∧ ∃𝑛 ∈ ℤ (𝑘 · 𝑥) < 𝑛))
96	95	simpld 494	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑘 · 𝑥) ∈ ℝ → ∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥))
97	94, 96	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥))
98		zre 12506	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℝ)
99	98	adantl 481	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℝ)
100		simpll 767	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → 𝑥 ∈ ℝ)
101	49	ad2antlr 728	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → (𝑘 ∈ ℝ ∧ 0 < 𝑘))
102		ltdivmul 12031	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑛 ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ (𝑘 ∈ ℝ ∧ 0 < 𝑘)) → ((𝑛 / 𝑘) < 𝑥 ↔ 𝑛 < (𝑘 · 𝑥)))
103	99, 100, 101, 102	syl3anc 1374	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → ((𝑛 / 𝑘) < 𝑥 ↔ 𝑛 < (𝑘 · 𝑥)))
104	103	rexbidva 3160	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (∃𝑛 ∈ ℤ (𝑛 / 𝑘) < 𝑥 ↔ ∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥)))
105	97, 104	mpbird 257	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∃𝑛 ∈ ℤ (𝑛 / 𝑘) < 𝑥)
106		rabn0 4343	. . . . . . . . . . . . . . . . . . 19 ⊢ ({𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ≠ ∅ ↔ ∃𝑛 ∈ ℤ (𝑛 / 𝑘) < 𝑥)
107	105, 106	sylibr 234	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ≠ ∅)
108	1	neeq1i 2997	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑇 ≠ ∅ ↔ {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ≠ ∅)
109	107, 108	sylibr 234	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 𝑇 ≠ ∅)
110	1	reqabi 3424	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ 𝑇 ↔ (𝑛 ∈ ℤ ∧ (𝑛 / 𝑘) < 𝑥))
111	47	ad2antlr 728	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → 𝑘 ∈ ℝ)
112	111, 100, 92	syl2anc 585	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → (𝑘 · 𝑥) ∈ ℝ)
113		ltle 11235	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑛 ∈ ℝ ∧ (𝑘 · 𝑥) ∈ ℝ) → (𝑛 < (𝑘 · 𝑥) → 𝑛 ≤ (𝑘 · 𝑥)))
114	99, 112, 113	syl2anc 585	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → (𝑛 < (𝑘 · 𝑥) → 𝑛 ≤ (𝑘 · 𝑥)))
115	103, 114	sylbid 240	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → ((𝑛 / 𝑘) < 𝑥 → 𝑛 ≤ (𝑘 · 𝑥)))
116	115	impr 454	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ (𝑛 ∈ ℤ ∧ (𝑛 / 𝑘) < 𝑥)) → 𝑛 ≤ (𝑘 · 𝑥))
117	110, 116	sylan2b 595	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑇) → 𝑛 ≤ (𝑘 · 𝑥))
118	117	ralrimiva 3130	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∀𝑛 ∈ 𝑇 𝑛 ≤ (𝑘 · 𝑥))
119		breq2 5104	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = (𝑘 · 𝑥) → (𝑛 ≤ 𝑦 ↔ 𝑛 ≤ (𝑘 · 𝑥)))
120	119	ralbidv 3161	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = (𝑘 · 𝑥) → (∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦 ↔ ∀𝑛 ∈ 𝑇 𝑛 ≤ (𝑘 · 𝑥)))
121	120	rspcev 3578	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑘 · 𝑥) ∈ ℝ ∧ ∀𝑛 ∈ 𝑇 𝑛 ≤ (𝑘 · 𝑥)) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦)
122	94, 118, 121	syl2anc 585	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦)
123	91, 109, 122	3jca 1129	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (𝑇 ⊆ ℝ ∧ 𝑇 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦))
124		suprub 12117	. . . . . . . . . . . . . . . 16 ⊢ (((𝑇 ⊆ ℝ ∧ 𝑇 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦) ∧ (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇) → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ))
125	123, 124	sylan 581	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇) → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ))
126	86, 125	syldan 592	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥) → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ))
127	126	ex 412	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥 → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < )))
128	42	zcnd 12611	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(𝑇, ℝ, < ) ∈ ℂ)
129		1cnd 11141	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 1 ∈ ℂ)
130		nncn 12167	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
131		nnne0 12193	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ ℕ → 𝑘 ≠ 0)
132	130, 131	jca 511	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ℕ → (𝑘 ∈ ℂ ∧ 𝑘 ≠ 0))
133	132	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (𝑘 ∈ ℂ ∧ 𝑘 ≠ 0))
134		divdir 11835	. . . . . . . . . . . . . . . 16 ⊢ ((sup(𝑇, ℝ, < ) ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝑘 ∈ ℂ ∧ 𝑘 ≠ 0)) → ((sup(𝑇, ℝ, < ) + 1) / 𝑘) = ((sup(𝑇, ℝ, < ) / 𝑘) + (1 / 𝑘)))
135	128, 129, 133, 134	syl3anc 1374	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(𝑇, ℝ, < ) + 1) / 𝑘) = ((sup(𝑇, ℝ, < ) / 𝑘) + (1 / 𝑘)))
136	3	mptex 7181	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)) ∈ V
137	2	fvmpt2 6963	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ ℝ ∧ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)) ∈ V) → (𝐹‘𝑥) = (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
138	136, 137	mpan2 692	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥) = (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
139	138	fveq1d 6846	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ → ((𝐹‘𝑥)‘𝑘) = ((𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))‘𝑘))
140		ovex 7403	. . . . . . . . . . . . . . . . . 18 ⊢ (sup(𝑇, ℝ, < ) / 𝑘) ∈ V
141		eqid 2737	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)) = (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))
142	141	fvmpt2 6963	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ ℕ ∧ (sup(𝑇, ℝ, < ) / 𝑘) ∈ V) → ((𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))‘𝑘) = (sup(𝑇, ℝ, < ) / 𝑘))
143	140, 142	mpan2 692	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ℕ → ((𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))‘𝑘) = (sup(𝑇, ℝ, < ) / 𝑘))
144	139, 143	sylan9eq 2792	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) = (sup(𝑇, ℝ, < ) / 𝑘))
145	144	oveq1d 7385	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) = ((sup(𝑇, ℝ, < ) / 𝑘) + (1 / 𝑘)))
146	135, 145	eqtr4d 2775	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(𝑇, ℝ, < ) + 1) / 𝑘) = (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)))
147	146	breq1d 5110	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥 ↔ (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
148	81	zred 12610	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (sup(𝑇, ℝ, < ) + 1) ∈ ℝ)
149	148, 43	lenltd 11293	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ) ↔ ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
150	127, 147, 149	3imtr3d 293	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
151	150	adantlr 716	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
152	80, 151	syld 47	. . . . . . . . . 10 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
153	152	exp31 419	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 → (𝑘 ∈ ℕ → ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))))
154	153	com4l 92	. . . . . . . 8 ⊢ (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 → (𝑘 ∈ ℕ → ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 → (𝑥 ∈ ℝ → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))))
155	154	com14 96	. . . . . . 7 ⊢ (𝑥 ∈ ℝ → (𝑘 ∈ ℕ → ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))))
156	155	3imp 1111	. . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘) → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
157	45, 156	mt2d 136	. . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘) → ¬ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥)
158	157	rexlimdv3a 3143	. . . 4 ⊢ (𝑥 ∈ ℝ → (∃𝑘 ∈ ℕ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 → ¬ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥))
159	41, 158	syld 47	. . 3 ⊢ (𝑥 ∈ ℝ → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 → ¬ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥))
160	159	pm2.01d 190	. 2 ⊢ (𝑥 ∈ ℝ → ¬ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥)
161		eqlelt 11234	. . 3 ⊢ ((sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (sup(ran (𝐹‘𝑥), ℝ, < ) = 𝑥 ↔ (sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥 ∧ ¬ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥)))
162	30, 161	mpancom 689	. 2 ⊢ (𝑥 ∈ ℝ → (sup(ran (𝐹‘𝑥), ℝ, < ) = 𝑥 ↔ (sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥 ∧ ¬ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥)))
163	29, 160, 162	mpbir2and 714	1 ⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) = 𝑥)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3401  Vcvv 3442   ⊆ wss 3903  ∅c0 4287   class class class wbr 5100   ↦ cmpt 5181  dom cdm 5634  ran crn 5635   Fn wfn 6497  ⟶wf 6498  ‘cfv 6502  (class class class)co 7370   ↑_m cmap 8777  supcsup 9357  ℂcc 11038  ℝcr 11039  0cc0 11040  1c1 11041   + caddc 11043   · cmul 11045   < clt 11180   ≤ cle 11181   − cmin 11378   / cdiv 11808  ℕcn 12159  ℤcz 12502  ℚcq 12875

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692  ax-resscn 11097  ax-1cn 11098  ax-icn 11099  ax-addcl 11100  ax-addrcl 11101  ax-mulcl 11102  ax-mulrcl 11103  ax-mulcom 11104  ax-addass 11105  ax-mulass 11106  ax-distr 11107  ax-i2m1 11108  ax-1ne0 11109  ax-1rid 11110  ax-rnegex 11111  ax-rrecex 11112  ax-cnre 11113  ax-pre-lttri 11114  ax-pre-lttrn 11115  ax-pre-ltadd 11116  ax-pre-mulgt0 11117  ax-pre-sup 11118

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-riota 7327  df-ov 7373  df-oprab 7374  df-mpo 7375  df-om 7821  df-1st 7945  df-2nd 7946  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-rdg 8353  df-er 8647  df-map 8779  df-en 8898  df-dom 8899  df-sdom 8900  df-sup 9359  df-pnf 11182  df-mnf 11183  df-xr 11184  df-ltxr 11185  df-le 11186  df-sub 11380  df-neg 11381  df-div 11809  df-nn 12160  df-n0 12416  df-z 12503  df-q 12876

This theorem is referenced by:  rpnnen1lem6  12909