Theorem rpnnen1lem5 12916

Description: Lemma for rpnnen1 12918. (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 12914	. . 3 ⊢ (𝑥 ∈ ℝ → ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥)
6	1, 2, 3, 4	rpnnen1lem1 12913	. . . . . 6 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥) ∈ (ℚ ↑m ℕ))
7	4, 3	elmap 8821	. . . . . 6 ⊢ ((𝐹‘𝑥) ∈ (ℚ ↑m ℕ) ↔ (𝐹‘𝑥):ℕ⟶ℚ)
8	6, 7	sylib 218	. . . . 5 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥):ℕ⟶ℚ)
9		frn 6677	. . . . . 6 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → ran (𝐹‘𝑥) ⊆ ℚ)
10		qssre 12894	. . . . . 6 ⊢ ℚ ⊆ ℝ
11	9, 10	sstrdi 3956	. . . . 5 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → ran (𝐹‘𝑥) ⊆ ℝ)
12	8, 11	syl 17	. . . 4 ⊢ (𝑥 ∈ ℝ → ran (𝐹‘𝑥) ⊆ ℝ)
13		1nn 12173	. . . . . . . 8 ⊢ 1 ∈ ℕ
14	13	ne0ii 4303	. . . . . . 7 ⊢ ℕ ≠ ∅
15		fdm 6679	. . . . . . . 8 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → dom (𝐹‘𝑥) = ℕ)
16	15	neeq1d 2984	. . . . . . 7 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → (dom (𝐹‘𝑥) ≠ ∅ ↔ ℕ ≠ ∅))
17	14, 16	mpbiri 258	. . . . . 6 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → dom (𝐹‘𝑥) ≠ ∅)
18		dm0rn0 5878	. . . . . . 7 ⊢ (dom (𝐹‘𝑥) = ∅ ↔ ran (𝐹‘𝑥) = ∅)
19	18	necon3bii 2977	. . . . . 6 ⊢ (dom (𝐹‘𝑥) ≠ ∅ ↔ ran (𝐹‘𝑥) ≠ ∅)
20	17, 19	sylib 218	. . . . 5 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → ran (𝐹‘𝑥) ≠ ∅)
21	8, 20	syl 17	. . . 4 ⊢ (𝑥 ∈ ℝ → ran (𝐹‘𝑥) ≠ ∅)
22		breq2 5106	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝑛 ≤ 𝑦 ↔ 𝑛 ≤ 𝑥))
23	22	ralbidv 3156	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦 ↔ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥))
24	23	rspcev 3585	. . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦)
25	5, 24	mpdan 687	. . . 4 ⊢ (𝑥 ∈ ℝ → ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦)
26		id 22	. . . 4 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ)
27		suprleub 12125	. . . 4 ⊢ (((ran (𝐹‘𝑥) ⊆ ℝ ∧ ran (𝐹‘𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦) ∧ 𝑥 ∈ ℝ) → (sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥))
28	12, 21, 25, 26, 27	syl31anc 1375	. . 3 ⊢ (𝑥 ∈ ℝ → (sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥 ↔ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑥))
29	5, 28	mpbird 257	. 2 ⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥)
30	1, 2, 3, 4	rpnnen1lem4 12915	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ)
31		resubcl 11462	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ) → (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ)
32	30, 31	mpdan 687	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ)
33	32	adantr 480	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ)
34		posdif 11647	. . . . . . . . . 10 ⊢ ((sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 ↔ 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
35	30, 34	mpancom 688	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 ↔ 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
36	35	biimpa 476	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )))
37	36	gt0ne0d 11718	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ≠ 0)
38	33, 37	rereccld 11985	. . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) ∈ ℝ)
39		arch 12415	. . . . . 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 12912	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(𝑇, ℝ, < ) ∈ ℤ)
43	42	zred 12614	. . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(𝑇, ℝ, < ) ∈ ℝ)
44	43	3adant3 1132	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘) → sup(𝑇, ℝ, < ) ∈ ℝ)
45	44	ltp1d 12089	. . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘) → sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1))
46	33, 36	jca 511	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) → ((𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ ∧ 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
47		nnre 12169	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℝ)
48		nngt0 12193	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ → 0 < 𝑘)
49	47, 48	jca 511	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → (𝑘 ∈ ℝ ∧ 0 < 𝑘))
50		ltrec1 12046	. . . . . . . . . . . . 13 ⊢ ((((𝑥 − sup(ran (𝐹‘𝑥), ℝ, < )) ∈ ℝ ∧ 0 < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) ∧ (𝑘 ∈ ℝ ∧ 0 < 𝑘)) → ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 ↔ (1 / 𝑘) < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
51	46, 49, 50	syl2an 596	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘 ↔ (1 / 𝑘) < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
52	30	ad2antrr 726	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ)
53		nnrecre 12204	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ → (1 / 𝑘) ∈ ℝ)
54	53	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ)
55		simpll 766	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → 𝑥 ∈ ℝ)
56	52, 54, 55	ltaddsub2d 11755	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ ℝ ∧ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥) ∧ 𝑘 ∈ ℕ) → ((sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 ↔ (1 / 𝑘) < (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))))
57	12	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ran (𝐹‘𝑥) ⊆ ℝ)
58		ffn 6670	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑥):ℕ⟶ℚ → (𝐹‘𝑥) Fn ℕ)
59	8, 58	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥) Fn ℕ)
60		fnfvelrn 7034	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹‘𝑥) Fn ℕ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) ∈ ran (𝐹‘𝑥))
61	59, 60	sylan 580	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) ∈ ran (𝐹‘𝑥))
62	57, 61	sseldd 3944	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) ∈ ℝ)
63	30	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ)
64	53	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ)
65	12, 21, 25	3jca 1128	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (ran (𝐹‘𝑥) ⊆ ℝ ∧ ran (𝐹‘𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦))
66	65	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (ran (𝐹‘𝑥) ⊆ ℝ ∧ ran (𝐹‘𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦))
67		suprub 12120	. . . . . . . . . . . . . . . . 17 ⊢ (((ran (𝐹‘𝑥) ⊆ ℝ ∧ ran (𝐹‘𝑥) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ ran (𝐹‘𝑥)𝑛 ≤ 𝑦) ∧ ((𝐹‘𝑥)‘𝑘) ∈ ran (𝐹‘𝑥)) → ((𝐹‘𝑥)‘𝑘) ≤ sup(ran (𝐹‘𝑥), ℝ, < ))
68	66, 61, 67	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) ≤ sup(ran (𝐹‘𝑥), ℝ, < ))
69	62, 63, 64, 68	leadd1dd 11768	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)))
70	62, 64	readdcld 11179	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ∈ ℝ)
71		readdcl 11127	. . . . . . . . . . . . . . . . 17 ⊢ ((sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ ∧ (1 / 𝑘) ∈ ℝ) → (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ)
72	30, 53, 71	syl2an 596	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) ∈ ℝ)
73		simpl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 𝑥 ∈ ℝ)
74		lelttr 11240	. . . . . . . . . . . . . . . . 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 1373	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) ≤ (sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) → ((sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥)))
77	69, 76	mpd 15	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(ran (𝐹‘𝑥), ℝ, < ) + (1 / 𝑘)) < 𝑥 → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
78	77	adantlr 715	. . . . . . . . . . . . 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 12617	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (sup(𝑇, ℝ, < ) + 1) ∈ ℤ)
82		oveq1 7376	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = (sup(𝑇, ℝ, < ) + 1) → (𝑛 / 𝑘) = ((sup(𝑇, ℝ, < ) + 1) / 𝑘))
83	82	breq1d 5112	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = (sup(𝑇, ℝ, < ) + 1) → ((𝑛 / 𝑘) < 𝑥 ↔ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥))
84	83, 1	elrab2 3659	. . . . . . . . . . . . . . . . 17 ⊢ ((sup(𝑇, ℝ, < ) + 1) ∈ 𝑇 ↔ ((sup(𝑇, ℝ, < ) + 1) ∈ ℤ ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥))
85	84	biimpri 228	. . . . . . . . . . . . . . . 16 ⊢ (((sup(𝑇, ℝ, < ) + 1) ∈ ℤ ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥) → (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇)
86	81, 85	sylan 580	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥) → (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇)
87		ssrab2 4039	. . . . . . . . . . . . . . . . . . . 20 ⊢ {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ⊆ ℤ
88	1, 87	eqsstri 3990	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝑇 ⊆ ℤ
89		zssre 12512	. . . . . . . . . . . . . . . . . . 19 ⊢ ℤ ⊆ ℝ
90	88, 89	sstri 3953	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑇 ⊆ ℝ
91	90	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 𝑇 ⊆ ℝ)
92		remulcl 11129	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑘 · 𝑥) ∈ ℝ)
93	92	ancoms 458	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℝ) → (𝑘 · 𝑥) ∈ ℝ)
94	47, 93	sylan2 593	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (𝑘 · 𝑥) ∈ ℝ)
95		btwnz 12613	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 · 𝑥) ∈ ℝ → (∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥) ∧ ∃𝑛 ∈ ℤ (𝑘 · 𝑥) < 𝑛))
96	95	simpld 494	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑘 · 𝑥) ∈ ℝ → ∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥))
97	94, 96	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥))
98		zre 12509	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℝ)
99	98	adantl 481	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℝ)
100		simpll 766	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → 𝑥 ∈ ℝ)
101	49	ad2antlr 727	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → (𝑘 ∈ ℝ ∧ 0 < 𝑘))
102		ltdivmul 12034	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑛 ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ (𝑘 ∈ ℝ ∧ 0 < 𝑘)) → ((𝑛 / 𝑘) < 𝑥 ↔ 𝑛 < (𝑘 · 𝑥)))
103	99, 100, 101, 102	syl3anc 1373	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → ((𝑛 / 𝑘) < 𝑥 ↔ 𝑛 < (𝑘 · 𝑥)))
104	103	rexbidva 3155	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (∃𝑛 ∈ ℤ (𝑛 / 𝑘) < 𝑥 ↔ ∃𝑛 ∈ ℤ 𝑛 < (𝑘 · 𝑥)))
105	97, 104	mpbird 257	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∃𝑛 ∈ ℤ (𝑛 / 𝑘) < 𝑥)
106		rabn0 4348	. . . . . . . . . . . . . . . . . . 19 ⊢ ({𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ≠ ∅ ↔ ∃𝑛 ∈ ℤ (𝑛 / 𝑘) < 𝑥)
107	105, 106	sylibr 234	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ≠ ∅)
108	1	neeq1i 2989	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑇 ≠ ∅ ↔ {𝑛 ∈ ℤ ∣ (𝑛 / 𝑘) < 𝑥} ≠ ∅)
109	107, 108	sylibr 234	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 𝑇 ≠ ∅)
110	1	reqabi 3426	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ 𝑇 ↔ (𝑛 ∈ ℤ ∧ (𝑛 / 𝑘) < 𝑥))
111	47	ad2antlr 727	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → 𝑘 ∈ ℝ)
112	111, 100, 92	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → (𝑘 · 𝑥) ∈ ℝ)
113		ltle 11238	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑛 ∈ ℝ ∧ (𝑘 · 𝑥) ∈ ℝ) → (𝑛 < (𝑘 · 𝑥) → 𝑛 ≤ (𝑘 · 𝑥)))
114	99, 112, 113	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → (𝑛 < (𝑘 · 𝑥) → 𝑛 ≤ (𝑘 · 𝑥)))
115	103, 114	sylbid 240	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ ℤ) → ((𝑛 / 𝑘) < 𝑥 → 𝑛 ≤ (𝑘 · 𝑥)))
116	115	impr 454	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ (𝑛 ∈ ℤ ∧ (𝑛 / 𝑘) < 𝑥)) → 𝑛 ≤ (𝑘 · 𝑥))
117	110, 116	sylan2b 594	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ 𝑛 ∈ 𝑇) → 𝑛 ≤ (𝑘 · 𝑥))
118	117	ralrimiva 3125	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∀𝑛 ∈ 𝑇 𝑛 ≤ (𝑘 · 𝑥))
119		breq2 5106	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = (𝑘 · 𝑥) → (𝑛 ≤ 𝑦 ↔ 𝑛 ≤ (𝑘 · 𝑥)))
120	119	ralbidv 3156	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = (𝑘 · 𝑥) → (∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦 ↔ ∀𝑛 ∈ 𝑇 𝑛 ≤ (𝑘 · 𝑥)))
121	120	rspcev 3585	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑘 · 𝑥) ∈ ℝ ∧ ∀𝑛 ∈ 𝑇 𝑛 ≤ (𝑘 · 𝑥)) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦)
122	94, 118, 121	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦)
123	91, 109, 122	3jca 1128	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (𝑇 ⊆ ℝ ∧ 𝑇 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦))
124		suprub 12120	. . . . . . . . . . . . . . . 16 ⊢ (((𝑇 ⊆ ℝ ∧ 𝑇 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑇 𝑛 ≤ 𝑦) ∧ (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇) → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ))
125	123, 124	sylan 580	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ (sup(𝑇, ℝ, < ) + 1) ∈ 𝑇) → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ))
126	86, 125	syldan 591	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) ∧ ((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥) → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ))
127	126	ex 412	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥 → (sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < )))
128	42	zcnd 12615	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → sup(𝑇, ℝ, < ) ∈ ℂ)
129		1cnd 11145	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → 1 ∈ ℂ)
130		nncn 12170	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
131		nnne0 12196	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ ℕ → 𝑘 ≠ 0)
132	130, 131	jca 511	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ℕ → (𝑘 ∈ ℂ ∧ 𝑘 ≠ 0))
133	132	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (𝑘 ∈ ℂ ∧ 𝑘 ≠ 0))
134		divdir 11838	. . . . . . . . . . . . . . . 16 ⊢ ((sup(𝑇, ℝ, < ) ∈ ℂ ∧ 1 ∈ ℂ ∧ (𝑘 ∈ ℂ ∧ 𝑘 ≠ 0)) → ((sup(𝑇, ℝ, < ) + 1) / 𝑘) = ((sup(𝑇, ℝ, < ) / 𝑘) + (1 / 𝑘)))
135	128, 129, 133, 134	syl3anc 1373	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(𝑇, ℝ, < ) + 1) / 𝑘) = ((sup(𝑇, ℝ, < ) / 𝑘) + (1 / 𝑘)))
136	3	mptex 7179	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)) ∈ V
137	2	fvmpt2 6961	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ ℝ ∧ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)) ∈ V) → (𝐹‘𝑥) = (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
138	136, 137	mpan2 691	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (𝐹‘𝑥) = (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)))
139	138	fveq1d 6842	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ → ((𝐹‘𝑥)‘𝑘) = ((𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))‘𝑘))
140		ovex 7402	. . . . . . . . . . . . . . . . . 18 ⊢ (sup(𝑇, ℝ, < ) / 𝑘) ∈ V
141		eqid 2729	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘)) = (𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))
142	141	fvmpt2 6961	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ ℕ ∧ (sup(𝑇, ℝ, < ) / 𝑘) ∈ V) → ((𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))‘𝑘) = (sup(𝑇, ℝ, < ) / 𝑘))
143	140, 142	mpan2 691	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ℕ → ((𝑘 ∈ ℕ ↦ (sup(𝑇, ℝ, < ) / 𝑘))‘𝑘) = (sup(𝑇, ℝ, < ) / 𝑘))
144	139, 143	sylan9eq 2784	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝑥)‘𝑘) = (sup(𝑇, ℝ, < ) / 𝑘))
145	144	oveq1d 7384	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) = ((sup(𝑇, ℝ, < ) / 𝑘) + (1 / 𝑘)))
146	135, 145	eqtr4d 2767	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(𝑇, ℝ, < ) + 1) / 𝑘) = (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)))
147	146	breq1d 5112	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (((sup(𝑇, ℝ, < ) + 1) / 𝑘) < 𝑥 ↔ (((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥))
148	81	zred 12614	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → (sup(𝑇, ℝ, < ) + 1) ∈ ℝ)
149	148, 43	lenltd 11296	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((sup(𝑇, ℝ, < ) + 1) ≤ sup(𝑇, ℝ, < ) ↔ ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
150	127, 147, 149	3imtr3d 293	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ) → ((((𝐹‘𝑥)‘𝑘) + (1 / 𝑘)) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
151	150	adantlr 715	. . . . . . . . . . 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 1110	. . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘) → (sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥 → ¬ sup(𝑇, ℝ, < ) < (sup(𝑇, ℝ, < ) + 1)))
157	45, 156	mt2d 136	. . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑘 ∈ ℕ ∧ (1 / (𝑥 − sup(ran (𝐹‘𝑥), ℝ, < ))) < 𝑘) → ¬ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥)
158	157	rexlimdv3a 3138	. . . 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 11237	. . 3 ⊢ ((sup(ran (𝐹‘𝑥), ℝ, < ) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (sup(ran (𝐹‘𝑥), ℝ, < ) = 𝑥 ↔ (sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥 ∧ ¬ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥)))
162	30, 161	mpancom 688	. 2 ⊢ (𝑥 ∈ ℝ → (sup(ran (𝐹‘𝑥), ℝ, < ) = 𝑥 ↔ (sup(ran (𝐹‘𝑥), ℝ, < ) ≤ 𝑥 ∧ ¬ sup(ran (𝐹‘𝑥), ℝ, < ) < 𝑥)))
163	29, 160, 162	mpbir2and 713	1 ⊢ (𝑥 ∈ ℝ → sup(ran (𝐹‘𝑥), ℝ, < ) = 𝑥)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  ∃wrex 3053  {crab 3402  Vcvv 3444   ⊆ wss 3911  ∅c0 4292   class class class wbr 5102   ↦ cmpt 5183  dom cdm 5631  ran crn 5632   Fn wfn 6494  ⟶wf 6495  ‘cfv 6499  (class class class)co 7369   ↑_m cmap 8776  supcsup 9367  ℂcc 11042  ℝcr 11043  0cc0 11044  1c1 11045   + caddc 11047   · cmul 11049   < clt 11184   ≤ cle 11185   − cmin 11381   / cdiv 11811  ℕcn 12162  ℤcz 12505  ℚcq 12883

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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121  ax-pre-sup 11122

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-er 8648  df-map 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-sup 9369  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-div 11812  df-nn 12163  df-n0 12419  df-z 12506  df-q 12884

This theorem is referenced by:  rpnnen1lem6  12917