ruclem12 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ruclem12		Structured version Visualization version GIF version

Theorem ruclem12 16216

Description: Lemma for ruc 16218. The supremum of the increasing sequence 1^st ∘ 𝐺 is a real number that is not in the range of 𝐹. (Contributed by Mario Carneiro, 28-May-2014.)

**Hypotheses**
Ref	Expression
ruc.1	⊢ (𝜑 → 𝐹:ℕ⟶ℝ)
ruc.2	⊢ (𝜑 → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1^st ‘𝑥) + (2^nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1^st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2^nd ‘𝑥)) / 2), (2^nd ‘𝑥)⟩)))
ruc.4	⊢ 𝐶 = ({⟨0, ⟨0, 1⟩⟩} ∪ 𝐹)
ruc.5	⊢ 𝐺 = seq0(𝐷, 𝐶)
ruc.6	⊢ 𝑆 = sup(ran (1^st ∘ 𝐺), ℝ, < )

**Assertion**
Ref	Expression
ruclem12	⊢ (𝜑 → 𝑆 ∈ (ℝ ∖ ran 𝐹))

Distinct variable groups: 𝑥,𝑚,𝑦,𝐹 𝑚,𝐺,𝑥,𝑦 Allowed substitution hints: 𝜑(𝑥,𝑦,𝑚) 𝐶(𝑥,𝑦,𝑚) 𝐷(𝑥,𝑦,𝑚) 𝑆(𝑥,𝑦,𝑚)

Proof of Theorem ruclem12 Dummy variables 𝑧 𝑛 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ruc.6	. . 3 ⊢ 𝑆 = sup(ran (1^st ∘ 𝐺), ℝ, < )
2		ruc.1	. . . . . 6 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ)
3		ruc.2	. . . . . 6 ⊢ (𝜑 → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1^st ‘𝑥) + (2^nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1^st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2^nd ‘𝑥)) / 2), (2^nd ‘𝑥)⟩)))
4		ruc.4	. . . . . 6 ⊢ 𝐶 = ({⟨0, ⟨0, 1⟩⟩} ∪ 𝐹)
5		ruc.5	. . . . . 6 ⊢ 𝐺 = seq0(𝐷, 𝐶)
6	2, 3, 4, 5	ruclem11 16215	. . . . 5 ⊢ (𝜑 → (ran (1^st ∘ 𝐺) ⊆ ℝ ∧ ran (1^st ∘ 𝐺) ≠ ∅ ∧ ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ 1))
7	6	simp1d 1142	. . . 4 ⊢ (𝜑 → ran (1^st ∘ 𝐺) ⊆ ℝ)
8	6	simp2d 1143	. . . 4 ⊢ (𝜑 → ran (1^st ∘ 𝐺) ≠ ∅)
9		1re 11181	. . . . 5 ⊢ 1 ∈ ℝ
10	6	simp3d 1144	. . . . 5 ⊢ (𝜑 → ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ 1)
11		brralrspcev 5170	. . . . 5 ⊢ ((1 ∈ ℝ ∧ ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ 1) → ∃𝑛 ∈ ℝ ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ 𝑛)
12	9, 10, 11	sylancr 587	. . . 4 ⊢ (𝜑 → ∃𝑛 ∈ ℝ ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ 𝑛)
13	7, 8, 12	suprcld 12153	. . 3 ⊢ (𝜑 → sup(ran (1^st ∘ 𝐺), ℝ, < ) ∈ ℝ)
14	1, 13	eqeltrid 2833	. 2 ⊢ (𝜑 → 𝑆 ∈ ℝ)
15	2	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐹:ℕ⟶ℝ)
16	3	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1^st ‘𝑥) + (2^nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1^st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2^nd ‘𝑥)) / 2), (2^nd ‘𝑥)⟩)))
17	2, 3, 4, 5	ruclem6 16210	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺:ℕ₀⟶(ℝ × ℝ))
18		nnm1nn0 12490	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ₀)
19		ffvelcdm 7056	. . . . . . . . . . 11 ⊢ ((𝐺:ℕ₀⟶(ℝ × ℝ) ∧ (𝑛 − 1) ∈ ℕ₀) → (𝐺‘(𝑛 − 1)) ∈ (ℝ × ℝ))
20	17, 18, 19	syl2an 596	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐺‘(𝑛 − 1)) ∈ (ℝ × ℝ))
21		xp1st 8003	. . . . . . . . . 10 ⊢ ((𝐺‘(𝑛 − 1)) ∈ (ℝ × ℝ) → (1^st ‘(𝐺‘(𝑛 − 1))) ∈ ℝ)
22	20, 21	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1^st ‘(𝐺‘(𝑛 − 1))) ∈ ℝ)
23		xp2nd 8004	. . . . . . . . . 10 ⊢ ((𝐺‘(𝑛 − 1)) ∈ (ℝ × ℝ) → (2^nd ‘(𝐺‘(𝑛 − 1))) ∈ ℝ)
24	20, 23	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (2^nd ‘(𝐺‘(𝑛 − 1))) ∈ ℝ)
25	2	ffvelcdmda 7059	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) ∈ ℝ)
26		eqid 2730	. . . . . . . . 9 ⊢ (1^st ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛))) = (1^st ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛)))
27		eqid 2730	. . . . . . . . 9 ⊢ (2^nd ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛))) = (2^nd ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛)))
28	2, 3, 4, 5	ruclem8 16212	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 − 1) ∈ ℕ₀) → (1^st ‘(𝐺‘(𝑛 − 1))) < (2^nd ‘(𝐺‘(𝑛 − 1))))
29	18, 28	sylan2 593	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1^st ‘(𝐺‘(𝑛 − 1))) < (2^nd ‘(𝐺‘(𝑛 − 1))))
30	15, 16, 22, 24, 25, 26, 27, 29	ruclem3 16208	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐹‘𝑛) < (1^st ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛))) ∨ (2^nd ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛))) < (𝐹‘𝑛)))
31	2, 3, 4, 5	ruclem7 16211	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 − 1) ∈ ℕ₀) → (𝐺‘((𝑛 − 1) + 1)) = ((𝐺‘(𝑛 − 1))𝐷(𝐹‘((𝑛 − 1) + 1))))
32	18, 31	sylan2 593	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐺‘((𝑛 − 1) + 1)) = ((𝐺‘(𝑛 − 1))𝐷(𝐹‘((𝑛 − 1) + 1))))
33		nncn 12201	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℂ)
34	33	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℂ)
35		ax-1cn 11133	. . . . . . . . . . . . . 14 ⊢ 1 ∈ ℂ
36		npcan 11437	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑛 − 1) + 1) = 𝑛)
37	34, 35, 36	sylancl 586	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑛 − 1) + 1) = 𝑛)
38	37	fveq2d 6865	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐺‘((𝑛 − 1) + 1)) = (𝐺‘𝑛))
39		1st2nd2 8010	. . . . . . . . . . . . . 14 ⊢ ((𝐺‘(𝑛 − 1)) ∈ (ℝ × ℝ) → (𝐺‘(𝑛 − 1)) = ⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩)
40	20, 39	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐺‘(𝑛 − 1)) = ⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩)
41	37	fveq2d 6865	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘((𝑛 − 1) + 1)) = (𝐹‘𝑛))
42	40, 41	oveq12d 7408	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐺‘(𝑛 − 1))𝐷(𝐹‘((𝑛 − 1) + 1))) = (⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛)))
43	32, 38, 42	3eqtr3d 2773	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐺‘𝑛) = (⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛)))
44	43	fveq2d 6865	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1^st ‘(𝐺‘𝑛)) = (1^st ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛))))
45	44	breq2d 5122	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐹‘𝑛) < (1^st ‘(𝐺‘𝑛)) ↔ (𝐹‘𝑛) < (1^st ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛)))))
46	43	fveq2d 6865	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (2^nd ‘(𝐺‘𝑛)) = (2^nd ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛))))
47	46	breq1d 5120	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2^nd ‘(𝐺‘𝑛)) < (𝐹‘𝑛) ↔ (2^nd ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛))) < (𝐹‘𝑛)))
48	45, 47	orbi12d 918	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((𝐹‘𝑛) < (1^st ‘(𝐺‘𝑛)) ∨ (2^nd ‘(𝐺‘𝑛)) < (𝐹‘𝑛)) ↔ ((𝐹‘𝑛) < (1^st ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛))) ∨ (2^nd ‘(⟨(1^st ‘(𝐺‘(𝑛 − 1))), (2^nd ‘(𝐺‘(𝑛 − 1)))⟩𝐷(𝐹‘𝑛))) < (𝐹‘𝑛))))
49	30, 48	mpbird 257	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐹‘𝑛) < (1^st ‘(𝐺‘𝑛)) ∨ (2^nd ‘(𝐺‘𝑛)) < (𝐹‘𝑛)))
50	7	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ran (1^st ∘ 𝐺) ⊆ ℝ)
51	8	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ran (1^st ∘ 𝐺) ≠ ∅)
52	12	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∃𝑛 ∈ ℝ ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ 𝑛)
53		nnnn0 12456	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ₀)
54		fvco3 6963	. . . . . . . . . . . . 13 ⊢ ((𝐺:ℕ₀⟶(ℝ × ℝ) ∧ 𝑛 ∈ ℕ₀) → ((1^st ∘ 𝐺)‘𝑛) = (1^st ‘(𝐺‘𝑛)))
55	17, 53, 54	syl2an 596	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1^st ∘ 𝐺)‘𝑛) = (1^st ‘(𝐺‘𝑛)))
56	17	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐺:ℕ₀⟶(ℝ × ℝ))
57		1stcof 8001	. . . . . . . . . . . . . 14 ⊢ (𝐺:ℕ₀⟶(ℝ × ℝ) → (1^st ∘ 𝐺):ℕ₀⟶ℝ)
58		ffn 6691	. . . . . . . . . . . . . 14 ⊢ ((1^st ∘ 𝐺):ℕ₀⟶ℝ → (1^st ∘ 𝐺) Fn ℕ₀)
59	56, 57, 58	3syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1^st ∘ 𝐺) Fn ℕ₀)
60	53	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ₀)
61		fnfvelrn 7055	. . . . . . . . . . . . 13 ⊢ (((1^st ∘ 𝐺) Fn ℕ₀ ∧ 𝑛 ∈ ℕ₀) → ((1^st ∘ 𝐺)‘𝑛) ∈ ran (1^st ∘ 𝐺))
62	59, 60, 61	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((1^st ∘ 𝐺)‘𝑛) ∈ ran (1^st ∘ 𝐺))
63	55, 62	eqeltrrd 2830	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1^st ‘(𝐺‘𝑛)) ∈ ran (1^st ∘ 𝐺))
64	50, 51, 52, 63	suprubd 12152	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1^st ‘(𝐺‘𝑛)) ≤ sup(ran (1^st ∘ 𝐺), ℝ, < ))
65	64, 1	breqtrrdi 5152	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1^st ‘(𝐺‘𝑛)) ≤ 𝑆)
66		ffvelcdm 7056	. . . . . . . . . . . 12 ⊢ ((𝐺:ℕ₀⟶(ℝ × ℝ) ∧ 𝑛 ∈ ℕ₀) → (𝐺‘𝑛) ∈ (ℝ × ℝ))
67	17, 53, 66	syl2an 596	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐺‘𝑛) ∈ (ℝ × ℝ))
68		xp1st 8003	. . . . . . . . . . 11 ⊢ ((𝐺‘𝑛) ∈ (ℝ × ℝ) → (1^st ‘(𝐺‘𝑛)) ∈ ℝ)
69	67, 68	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1^st ‘(𝐺‘𝑛)) ∈ ℝ)
70	14	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑆 ∈ ℝ)
71		ltletr 11273	. . . . . . . . . 10 ⊢ (((𝐹‘𝑛) ∈ ℝ ∧ (1^st ‘(𝐺‘𝑛)) ∈ ℝ ∧ 𝑆 ∈ ℝ) → (((𝐹‘𝑛) < (1^st ‘(𝐺‘𝑛)) ∧ (1^st ‘(𝐺‘𝑛)) ≤ 𝑆) → (𝐹‘𝑛) < 𝑆))
72	25, 69, 70, 71	syl3anc 1373	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((𝐹‘𝑛) < (1^st ‘(𝐺‘𝑛)) ∧ (1^st ‘(𝐺‘𝑛)) ≤ 𝑆) → (𝐹‘𝑛) < 𝑆))
73	65, 72	mpan2d 694	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐹‘𝑛) < (1^st ‘(𝐺‘𝑛)) → (𝐹‘𝑛) < 𝑆))
74		fvco3 6963	. . . . . . . . . . . . . . 15 ⊢ ((𝐺:ℕ₀⟶(ℝ × ℝ) ∧ 𝑘 ∈ ℕ₀) → ((1^st ∘ 𝐺)‘𝑘) = (1^st ‘(𝐺‘𝑘)))
75	56, 74	sylan 580	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → ((1^st ∘ 𝐺)‘𝑘) = (1^st ‘(𝐺‘𝑘)))
76	56	ffvelcdmda 7059	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → (𝐺‘𝑘) ∈ (ℝ × ℝ))
77		xp1st 8003	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺‘𝑘) ∈ (ℝ × ℝ) → (1^st ‘(𝐺‘𝑘)) ∈ ℝ)
78	76, 77	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → (1^st ‘(𝐺‘𝑘)) ∈ ℝ)
79		xp2nd 8004	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺‘𝑛) ∈ (ℝ × ℝ) → (2^nd ‘(𝐺‘𝑛)) ∈ ℝ)
80	67, 79	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (2^nd ‘(𝐺‘𝑛)) ∈ ℝ)
81	80	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → (2^nd ‘(𝐺‘𝑛)) ∈ ℝ)
82	15	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → 𝐹:ℕ⟶ℝ)
83	16	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1^st ‘𝑥) + (2^nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1^st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2^nd ‘𝑥)) / 2), (2^nd ‘𝑥)⟩)))
84		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → 𝑘 ∈ ℕ₀)
85	60	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → 𝑛 ∈ ℕ₀)
86	82, 83, 4, 5, 84, 85	ruclem10 16214	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → (1^st ‘(𝐺‘𝑘)) < (2^nd ‘(𝐺‘𝑛)))
87	78, 81, 86	ltled 11329	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → (1^st ‘(𝐺‘𝑘)) ≤ (2^nd ‘(𝐺‘𝑛)))
88	75, 87	eqbrtrd 5132	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ ℕ₀) → ((1^st ∘ 𝐺)‘𝑘) ≤ (2^nd ‘(𝐺‘𝑛)))
89	88	ralrimiva 3126	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∀𝑘 ∈ ℕ₀ ((1^st ∘ 𝐺)‘𝑘) ≤ (2^nd ‘(𝐺‘𝑛)))
90		breq1 5113	. . . . . . . . . . . . . 14 ⊢ (𝑧 = ((1^st ∘ 𝐺)‘𝑘) → (𝑧 ≤ (2^nd ‘(𝐺‘𝑛)) ↔ ((1^st ∘ 𝐺)‘𝑘) ≤ (2^nd ‘(𝐺‘𝑛))))
91	90	ralrn 7063	. . . . . . . . . . . . 13 ⊢ ((1^st ∘ 𝐺) Fn ℕ₀ → (∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ (2^nd ‘(𝐺‘𝑛)) ↔ ∀𝑘 ∈ ℕ₀ ((1^st ∘ 𝐺)‘𝑘) ≤ (2^nd ‘(𝐺‘𝑛))))
92	59, 91	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ (2^nd ‘(𝐺‘𝑛)) ↔ ∀𝑘 ∈ ℕ₀ ((1^st ∘ 𝐺)‘𝑘) ≤ (2^nd ‘(𝐺‘𝑛))))
93	89, 92	mpbird 257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ (2^nd ‘(𝐺‘𝑛)))
94		suprleub 12156	. . . . . . . . . . . 12 ⊢ (((ran (1^st ∘ 𝐺) ⊆ ℝ ∧ ran (1^st ∘ 𝐺) ≠ ∅ ∧ ∃𝑛 ∈ ℝ ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ 𝑛) ∧ (2^nd ‘(𝐺‘𝑛)) ∈ ℝ) → (sup(ran (1^st ∘ 𝐺), ℝ, < ) ≤ (2^nd ‘(𝐺‘𝑛)) ↔ ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ (2^nd ‘(𝐺‘𝑛))))
95	50, 51, 52, 80, 94	syl31anc 1375	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (sup(ran (1^st ∘ 𝐺), ℝ, < ) ≤ (2^nd ‘(𝐺‘𝑛)) ↔ ∀𝑧 ∈ ran (1^st ∘ 𝐺)𝑧 ≤ (2^nd ‘(𝐺‘𝑛))))
96	93, 95	mpbird 257	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → sup(ran (1^st ∘ 𝐺), ℝ, < ) ≤ (2^nd ‘(𝐺‘𝑛)))
97	1, 96	eqbrtrid 5145	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑆 ≤ (2^nd ‘(𝐺‘𝑛)))
98		lelttr 11271	. . . . . . . . . 10 ⊢ ((𝑆 ∈ ℝ ∧ (2^nd ‘(𝐺‘𝑛)) ∈ ℝ ∧ (𝐹‘𝑛) ∈ ℝ) → ((𝑆 ≤ (2^nd ‘(𝐺‘𝑛)) ∧ (2^nd ‘(𝐺‘𝑛)) < (𝐹‘𝑛)) → 𝑆 < (𝐹‘𝑛)))
99	70, 80, 25, 98	syl3anc 1373	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝑆 ≤ (2^nd ‘(𝐺‘𝑛)) ∧ (2^nd ‘(𝐺‘𝑛)) < (𝐹‘𝑛)) → 𝑆 < (𝐹‘𝑛)))
100	97, 99	mpand 695	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((2^nd ‘(𝐺‘𝑛)) < (𝐹‘𝑛) → 𝑆 < (𝐹‘𝑛)))
101	73, 100	orim12d 966	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((𝐹‘𝑛) < (1^st ‘(𝐺‘𝑛)) ∨ (2^nd ‘(𝐺‘𝑛)) < (𝐹‘𝑛)) → ((𝐹‘𝑛) < 𝑆 ∨ 𝑆 < (𝐹‘𝑛))))
102	49, 101	mpd 15	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐹‘𝑛) < 𝑆 ∨ 𝑆 < (𝐹‘𝑛)))
103	25, 70	lttri2d 11320	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐹‘𝑛) ≠ 𝑆 ↔ ((𝐹‘𝑛) < 𝑆 ∨ 𝑆 < (𝐹‘𝑛))))
104	102, 103	mpbird 257	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) ≠ 𝑆)
105	104	neneqd 2931	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ¬ (𝐹‘𝑛) = 𝑆)
106	105	nrexdv 3129	. . 3 ⊢ (𝜑 → ¬ ∃𝑛 ∈ ℕ (𝐹‘𝑛) = 𝑆)
107		risset 3213	. . . 4 ⊢ (𝑆 ∈ ran 𝐹 ↔ ∃𝑧 ∈ ran 𝐹 𝑧 = 𝑆)
108		ffn 6691	. . . . 5 ⊢ (𝐹:ℕ⟶ℝ → 𝐹 Fn ℕ)
109		eqeq1 2734	. . . . . 6 ⊢ (𝑧 = (𝐹‘𝑛) → (𝑧 = 𝑆 ↔ (𝐹‘𝑛) = 𝑆))
110	109	rexrn 7062	. . . . 5 ⊢ (𝐹 Fn ℕ → (∃𝑧 ∈ ran 𝐹 𝑧 = 𝑆 ↔ ∃𝑛 ∈ ℕ (𝐹‘𝑛) = 𝑆))
111	2, 108, 110	3syl 18	. . . 4 ⊢ (𝜑 → (∃𝑧 ∈ ran 𝐹 𝑧 = 𝑆 ↔ ∃𝑛 ∈ ℕ (𝐹‘𝑛) = 𝑆))
112	107, 111	bitrid 283	. . 3 ⊢ (𝜑 → (𝑆 ∈ ran 𝐹 ↔ ∃𝑛 ∈ ℕ (𝐹‘𝑛) = 𝑆))
113	106, 112	mtbird 325	. 2 ⊢ (𝜑 → ¬ 𝑆 ∈ ran 𝐹)
114	14, 113	eldifd 3928	1 ⊢ (𝜑 → 𝑆 ∈ (ℝ ∖ ran 𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ∀wral 3045 ∃wrex 3054 ⦋csb 3865 ∖ cdif 3914 ∪ cun 3915 ⊆ wss 3917 ∅c0 4299 ifcif 4491 {csn 4592 ⟨cop 4598 class class class wbr 5110 × cxp 5639 ran crn 5642 ∘ ccom 5645 Fn wfn 6509 ⟶wf 6510 ‘cfv 6514 (class class class)co 7390 ∈ cmpo 7392 1^st c1st 7969 2^nd c2nd 7970 supcsup 9398 ℂcc 11073 ℝcr 11074 0cc0 11075 1c1 11076 + caddc 11078 < clt 11215 ≤ cle 11216 − cmin 11412 / cdiv 11842 ℕcn 12193 2c2 12248 ℕ₀cn0 12449 seqcseq 13973

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 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153

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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-sup 9400 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-div 11843 df-nn 12194 df-2 12256 df-n0 12450 df-z 12537 df-uz 12801 df-fz 13476 df-seq 13974

This theorem is referenced by: ruclem13 16217

W3C validator