bfplem1 - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > bfplem1		Structured version Visualization version GIF version

Theorem bfplem1 38513

Description: Lemma for bfp 38515. The sequence 𝐺, which simply starts from any point in the space and iterates 𝐹, satisfies the property that the distance from 𝐺(𝑛) to 𝐺(𝑛 + 1) decreases by at least 𝐾 after each step. Thus, the total distance from any 𝐺(𝑖) to 𝐺(𝑗) is bounded by a geometric series, and the sequence is Cauchy. Therefore, it converges to a point ((⇝_𝑡‘𝐽)‘𝐺) since the space is complete. (Contributed by Jeff Madsen, 17-Jun-2014.)

**Hypotheses**
Ref	Expression
bfp.2	⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
bfp.3	⊢ (𝜑 → 𝑋 ≠ ∅)
bfp.4	⊢ (𝜑 → 𝐾 ∈ ℝ⁺)
bfp.5	⊢ (𝜑 → 𝐾 < 1)
bfp.6	⊢ (𝜑 → 𝐹:𝑋⟶𝑋)
bfp.7	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) ≤ (𝐾 · (𝑥𝐷𝑦)))
bfp.8	⊢ 𝐽 = (MetOpen‘𝐷)
bfp.9	⊢ (𝜑 → 𝐴 ∈ 𝑋)
bfp.10	⊢ 𝐺 = seq1((𝐹 ∘ 1^st ), (ℕ × {𝐴}))

**Assertion**
Ref	Expression
bfplem1	⊢ (𝜑 → 𝐺(⇝_𝑡‘𝐽)((⇝_𝑡‘𝐽)‘𝐺))

Distinct variable groups: 𝑥,𝑦,𝐷 𝑥,𝐺,𝑦 𝑥,𝐽,𝑦 𝜑,𝑥,𝑦 𝑥,𝐹,𝑦 𝑥,𝐾,𝑦 𝑥,𝑋,𝑦 Allowed substitution hints: 𝐴(𝑥, 𝑦)

Proof of Theorem bfplem1 Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bfp.2	. . 3 ⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
2		cmetmet 25482	. . . . 5 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋))
3	1, 2	syl 18	. . . 4 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
4		nnuz 12919	. . . . 5 ⊢ ℕ = (ℤ_≥‘1)
5		bfp.10	. . . . 5 ⊢ 𝐺 = seq1((𝐹 ∘ 1^st ), (ℕ × {𝐴}))
6		1zzd 12643	. . . . 5 ⊢ (𝜑 → 1 ∈ ℤ)
7		bfp.9	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
8		bfp.6	. . . . 5 ⊢ (𝜑 → 𝐹:𝑋⟶𝑋)
9	4, 5, 6, 7, 8	algrf 16656	. . . 4 ⊢ (𝜑 → 𝐺:ℕ⟶𝑋)
10	8, 7	ffvelcdmd 7087	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐴) ∈ 𝑋)
11		metcl 24526	. . . . . 6 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ (𝐹‘𝐴) ∈ 𝑋) → (𝐴𝐷(𝐹‘𝐴)) ∈ ℝ)
12	3, 7, 10, 11	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (𝐴𝐷(𝐹‘𝐴)) ∈ ℝ)
13		bfp.4	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℝ⁺)
14	12, 13	rerpdivcld 13109	. . . 4 ⊢ (𝜑 → ((𝐴𝐷(𝐹‘𝐴)) / 𝐾) ∈ ℝ)
15		bfp.5	. . . 4 ⊢ (𝜑 → 𝐾 < 1)
16		fveq2 6888	. . . . . . . . 9 ⊢ (𝑗 = 1 → (𝐺‘𝑗) = (𝐺‘1))
17		fvoveq1 7446	. . . . . . . . 9 ⊢ (𝑗 = 1 → (𝐺‘(𝑗 + 1)) = (𝐺‘(1 + 1)))
18	16, 17	oveq12d 7441	. . . . . . . 8 ⊢ (𝑗 = 1 → ((𝐺‘𝑗)𝐷(𝐺‘(𝑗 + 1))) = ((𝐺‘1)𝐷(𝐺‘(1 + 1))))
19		oveq2 7431	. . . . . . . . 9 ⊢ (𝑗 = 1 → (𝐾↑𝑗) = (𝐾↑1))
20	19	oveq2d 7439	. . . . . . . 8 ⊢ (𝑗 = 1 → (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑗)) = (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑1)))
21	18, 20	breq12d 5127	. . . . . . 7 ⊢ (𝑗 = 1 → (((𝐺‘𝑗)𝐷(𝐺‘(𝑗 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑗)) ↔ ((𝐺‘1)𝐷(𝐺‘(1 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑1))))
22	21	imbi2d 343	. . . . . 6 ⊢ (𝑗 = 1 → ((𝜑 → ((𝐺‘𝑗)𝐷(𝐺‘(𝑗 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑗))) ↔ (𝜑 → ((𝐺‘1)𝐷(𝐺‘(1 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑1)))))
23		fveq2 6888	. . . . . . . . 9 ⊢ (𝑗 = 𝑘 → (𝐺‘𝑗) = (𝐺‘𝑘))
24		fvoveq1 7446	. . . . . . . . 9 ⊢ (𝑗 = 𝑘 → (𝐺‘(𝑗 + 1)) = (𝐺‘(𝑘 + 1)))
25	23, 24	oveq12d 7441	. . . . . . . 8 ⊢ (𝑗 = 𝑘 → ((𝐺‘𝑗)𝐷(𝐺‘(𝑗 + 1))) = ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))))
26		oveq2 7431	. . . . . . . . 9 ⊢ (𝑗 = 𝑘 → (𝐾↑𝑗) = (𝐾↑𝑘))
27	26	oveq2d 7439	. . . . . . . 8 ⊢ (𝑗 = 𝑘 → (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑗)) = (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)))
28	25, 27	breq12d 5127	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (((𝐺‘𝑗)𝐷(𝐺‘(𝑗 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑗)) ↔ ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘))))
29	28	imbi2d 343	. . . . . 6 ⊢ (𝑗 = 𝑘 → ((𝜑 → ((𝐺‘𝑗)𝐷(𝐺‘(𝑗 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑗))) ↔ (𝜑 → ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)))))
30		fveq2 6888	. . . . . . . . 9 ⊢ (𝑗 = (𝑘 + 1) → (𝐺‘𝑗) = (𝐺‘(𝑘 + 1)))
31		fvoveq1 7446	. . . . . . . . 9 ⊢ (𝑗 = (𝑘 + 1) → (𝐺‘(𝑗 + 1)) = (𝐺‘((𝑘 + 1) + 1)))
32	30, 31	oveq12d 7441	. . . . . . . 8 ⊢ (𝑗 = (𝑘 + 1) → ((𝐺‘𝑗)𝐷(𝐺‘(𝑗 + 1))) = ((𝐺‘(𝑘 + 1))𝐷(𝐺‘((𝑘 + 1) + 1))))
33		oveq2 7431	. . . . . . . . 9 ⊢ (𝑗 = (𝑘 + 1) → (𝐾↑𝑗) = (𝐾↑(𝑘 + 1)))
34	33	oveq2d 7439	. . . . . . . 8 ⊢ (𝑗 = (𝑘 + 1) → (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑗)) = (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))))
35	32, 34	breq12d 5127	. . . . . . 7 ⊢ (𝑗 = (𝑘 + 1) → (((𝐺‘𝑗)𝐷(𝐺‘(𝑗 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑗)) ↔ ((𝐺‘(𝑘 + 1))𝐷(𝐺‘((𝑘 + 1) + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))))
36	35	imbi2d 343	. . . . . 6 ⊢ (𝑗 = (𝑘 + 1) → ((𝜑 → ((𝐺‘𝑗)𝐷(𝐺‘(𝑗 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑗))) ↔ (𝜑 → ((𝐺‘(𝑘 + 1))𝐷(𝐺‘((𝑘 + 1) + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))))))
37	12	leidd 11798	. . . . . . 7 ⊢ (𝜑 → (𝐴𝐷(𝐹‘𝐴)) ≤ (𝐴𝐷(𝐹‘𝐴)))
38	4, 5, 6, 7	algr0 16655	. . . . . . . 8 ⊢ (𝜑 → (𝐺‘1) = 𝐴)
39		1nn 12262	. . . . . . . . . 10 ⊢ 1 ∈ ℕ
40	4, 5, 6, 7, 8	algrp1 16657	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 1 ∈ ℕ) → (𝐺‘(1 + 1)) = (𝐹‘(𝐺‘1)))
41	39, 40	mpan2 704	. . . . . . . . 9 ⊢ (𝜑 → (𝐺‘(1 + 1)) = (𝐹‘(𝐺‘1)))
42	38	fveq2d 6892	. . . . . . . . 9 ⊢ (𝜑 → (𝐹‘(𝐺‘1)) = (𝐹‘𝐴))
43	41, 42	eqtrd 2801	. . . . . . . 8 ⊢ (𝜑 → (𝐺‘(1 + 1)) = (𝐹‘𝐴))
44	38, 43	oveq12d 7441	. . . . . . 7 ⊢ (𝜑 → ((𝐺‘1)𝐷(𝐺‘(1 + 1))) = (𝐴𝐷(𝐹‘𝐴)))
45	13	rpred 13078	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐾 ∈ ℝ)
46	45	recnd 11255	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ ℂ)
47	46	exp1d 14197	. . . . . . . . 9 ⊢ (𝜑 → (𝐾↑1) = 𝐾)
48	47	oveq2d 7439	. . . . . . . 8 ⊢ (𝜑 → (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑1)) = (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · 𝐾))
49	12	recnd 11255	. . . . . . . . 9 ⊢ (𝜑 → (𝐴𝐷(𝐹‘𝐴)) ∈ ℂ)
50	13	rpne0d 13083	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ≠ 0)
51	49, 46, 50	divcan1d 12010	. . . . . . . 8 ⊢ (𝜑 → (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · 𝐾) = (𝐴𝐷(𝐹‘𝐴)))
52	48, 51	eqtrd 2801	. . . . . . 7 ⊢ (𝜑 → (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑1)) = (𝐴𝐷(𝐹‘𝐴)))
53	37, 44, 52	3brtr4d 5148	. . . . . 6 ⊢ (𝜑 → ((𝐺‘1)𝐷(𝐺‘(1 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑1)))
54	9	ffvelcdmda 7086	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘𝑘) ∈ 𝑋)
55		peano2nn 12263	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → (𝑘 + 1) ∈ ℕ)
56		ffvelcdm 7083	. . . . . . . . . . . . 13 ⊢ ((𝐺:ℕ⟶𝑋 ∧ (𝑘 + 1) ∈ ℕ) → (𝐺‘(𝑘 + 1)) ∈ 𝑋)
57	9, 55, 56	syl2an 608	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘(𝑘 + 1)) ∈ 𝑋)
58	54, 57	jca 521	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐺‘𝑘) ∈ 𝑋 ∧ (𝐺‘(𝑘 + 1)) ∈ 𝑋))
59		bfp.7	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) ≤ (𝐾 · (𝑥𝐷𝑦)))
60	59	ralrimivva 3211	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) ≤ (𝐾 · (𝑥𝐷𝑦)))
61	60	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) ≤ (𝐾 · (𝑥𝐷𝑦)))
62		fveq2 6888	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝐺‘𝑘) → (𝐹‘𝑥) = (𝐹‘(𝐺‘𝑘)))
63	62	oveq1d 7438	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝐺‘𝑘) → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) = ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘𝑦)))
64		oveq1 7430	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝐺‘𝑘) → (𝑥𝐷𝑦) = ((𝐺‘𝑘)𝐷𝑦))
65	64	oveq2d 7439	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝐺‘𝑘) → (𝐾 · (𝑥𝐷𝑦)) = (𝐾 · ((𝐺‘𝑘)𝐷𝑦)))
66	63, 65	breq12d 5127	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐺‘𝑘) → (((𝐹‘𝑥)𝐷(𝐹‘𝑦)) ≤ (𝐾 · (𝑥𝐷𝑦)) ↔ ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘𝑦)) ≤ (𝐾 · ((𝐺‘𝑘)𝐷𝑦))))
67		fveq2 6888	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝐺‘(𝑘 + 1)) → (𝐹‘𝑦) = (𝐹‘(𝐺‘(𝑘 + 1))))
68	67	oveq2d 7439	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝐺‘(𝑘 + 1)) → ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘𝑦)) = ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))))
69		oveq2 7431	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝐺‘(𝑘 + 1)) → ((𝐺‘𝑘)𝐷𝑦) = ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))))
70	69	oveq2d 7439	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝐺‘(𝑘 + 1)) → (𝐾 · ((𝐺‘𝑘)𝐷𝑦)) = (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))))
71	68, 70	breq12d 5127	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐺‘(𝑘 + 1)) → (((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘𝑦)) ≤ (𝐾 · ((𝐺‘𝑘)𝐷𝑦)) ↔ ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ≤ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))))))
72	66, 71	rspc2v 3595	. . . . . . . . . . 11 ⊢ (((𝐺‘𝑘) ∈ 𝑋 ∧ (𝐺‘(𝑘 + 1)) ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) ≤ (𝐾 · (𝑥𝐷𝑦)) → ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ≤ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))))))
73	58, 61, 72	sylc 66	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ≤ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))))
74	3	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐷 ∈ (Met‘𝑋))
75	8	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐹:𝑋⟶𝑋)
76	75, 54	ffvelcdmd 7087	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘(𝐺‘𝑘)) ∈ 𝑋)
77	75, 57	ffvelcdmd 7087	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘(𝐺‘(𝑘 + 1))) ∈ 𝑋)
78		metcl 24526	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐹‘(𝐺‘𝑘)) ∈ 𝑋 ∧ (𝐹‘(𝐺‘(𝑘 + 1))) ∈ 𝑋) → ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ∈ ℝ)
79	74, 76, 77, 78	syl3anc 1398	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ∈ ℝ)
80	45	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐾 ∈ ℝ)
81		metcl 24526	. . . . . . . . . . . . 13 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐺‘𝑘) ∈ 𝑋 ∧ (𝐺‘(𝑘 + 1)) ∈ 𝑋) → ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ∈ ℝ)
82	74, 54, 57, 81	syl3anc 1398	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ∈ ℝ)
83	80, 82	remulcld 11257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))) ∈ ℝ)
84	14	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐴𝐷(𝐹‘𝐴)) / 𝐾) ∈ ℝ)
85	55	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑘 + 1) ∈ ℕ)
86	85	nnnn0d 12583	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑘 + 1) ∈ ℕ₀)
87	80, 86	reexpcld 14219	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐾↑(𝑘 + 1)) ∈ ℝ)
88	84, 87	remulcld 11257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))) ∈ ℝ)
89		letr 11322	. . . . . . . . . . 11 ⊢ ((((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ∈ ℝ ∧ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))) ∈ ℝ ∧ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))) ∈ ℝ) → ((((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ≤ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))) ∧ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))) → ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))))
90	79, 83, 88, 89	syl3anc 1398	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ≤ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))) ∧ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))) → ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))))
91	73, 90	mpand 708	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))) → ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))))
92		nnnn0 12529	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ₀)
93		reexpcl 14134	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℝ ∧ 𝑘 ∈ ℕ₀) → (𝐾↑𝑘) ∈ ℝ)
94	45, 92, 93	syl2an 608	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐾↑𝑘) ∈ ℝ)
95	84, 94	remulcld 11257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) ∈ ℝ)
96	13	rpgt0d 13081	. . . . . . . . . . . 12 ⊢ (𝜑 → 0 < 𝐾)
97	96	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 < 𝐾)
98		lemul1 12085	. . . . . . . . . . 11 ⊢ ((((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ∈ ℝ ∧ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) ∈ ℝ ∧ (𝐾 ∈ ℝ ∧ 0 < 𝐾)) → (((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) ↔ (((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) · 𝐾) ≤ ((((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) · 𝐾)))
99	82, 95, 80, 97, 98	syl112anc 1401	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) ↔ (((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) · 𝐾) ≤ ((((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) · 𝐾)))
100	82	recnd 11255	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ∈ ℂ)
101	46	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝐾 ∈ ℂ)
102	100, 101	mulcomd 11248	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) · 𝐾) = (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))))
103	84	recnd 11255	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐴𝐷(𝐹‘𝐴)) / 𝐾) ∈ ℂ)
104	94	recnd 11255	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐾↑𝑘) ∈ ℂ)
105	103, 104, 101	mulassd 11250	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) · 𝐾) = (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · ((𝐾↑𝑘) · 𝐾)))
106		expp1 14124	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝐾↑(𝑘 + 1)) = ((𝐾↑𝑘) · 𝐾))
107	46, 92, 106	syl2an 608	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐾↑(𝑘 + 1)) = ((𝐾↑𝑘) · 𝐾))
108	107	oveq2d 7439	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))) = (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · ((𝐾↑𝑘) · 𝐾)))
109	105, 108	eqtr4d 2804	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) · 𝐾) = (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))))
110	102, 109	breq12d 5127	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) · 𝐾) ≤ ((((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) · 𝐾) ↔ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))))
111	99, 110	bitrd 282	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) ↔ (𝐾 · ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1)))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))))
112	4, 5, 6, 7, 8	algrp1 16657	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘(𝑘 + 1)) = (𝐹‘(𝐺‘𝑘)))
113	4, 5, 6, 7, 8	algrp1 16657	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 + 1) ∈ ℕ) → (𝐺‘((𝑘 + 1) + 1)) = (𝐹‘(𝐺‘(𝑘 + 1))))
114	55, 113	sylan2 605	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘((𝑘 + 1) + 1)) = (𝐹‘(𝐺‘(𝑘 + 1))))
115	112, 114	oveq12d 7441	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐺‘(𝑘 + 1))𝐷(𝐺‘((𝑘 + 1) + 1))) = ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))))
116	115	breq1d 5124	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐺‘(𝑘 + 1))𝐷(𝐺‘((𝑘 + 1) + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))) ↔ ((𝐹‘(𝐺‘𝑘))𝐷(𝐹‘(𝐺‘(𝑘 + 1)))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))))
117	91, 111, 116	3imtr4d 297	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) → ((𝐺‘(𝑘 + 1))𝐷(𝐺‘((𝑘 + 1) + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1)))))
118	117	expcom 419	. . . . . . 7 ⊢ (𝑘 ∈ ℕ → (𝜑 → (((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)) → ((𝐺‘(𝑘 + 1))𝐷(𝐺‘((𝑘 + 1) + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))))))
119	118	a2d 30	. . . . . 6 ⊢ (𝑘 ∈ ℕ → ((𝜑 → ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘))) → (𝜑 → ((𝐺‘(𝑘 + 1))𝐷(𝐺‘((𝑘 + 1) + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑(𝑘 + 1))))))
120	22, 29, 36, 29, 53, 119	nnind 12269	. . . . 5 ⊢ (𝑘 ∈ ℕ → (𝜑 → ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘))))
121	120	impcom 413	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐺‘𝑘)𝐷(𝐺‘(𝑘 + 1))) ≤ (((𝐴𝐷(𝐹‘𝐴)) / 𝐾) · (𝐾↑𝑘)))
122	3, 9, 14, 13, 15, 121	geomcau 38450	. . 3 ⊢ (𝜑 → 𝐺 ∈ (Cau‘𝐷))
123		bfp.8	. . . 4 ⊢ 𝐽 = (MetOpen‘𝐷)
124	123	cmetcau 25485	. . 3 ⊢ ((𝐷 ∈ (CMet‘𝑋) ∧ 𝐺 ∈ (Cau‘𝐷)) → 𝐺 ∈ dom (⇝_𝑡‘𝐽))
125	1, 122, 124	syl2anc 596	. 2 ⊢ (𝜑 → 𝐺 ∈ dom (⇝_𝑡‘𝐽))
126		metxmet 24528	. . . 4 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
127	123	methaus 24714	. . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ Haus)
128	3, 126, 127	3syl 19	. . 3 ⊢ (𝜑 → 𝐽 ∈ Haus)
129		lmfun 23575	. . 3 ⊢ (𝐽 ∈ Haus → Fun (⇝_𝑡‘𝐽))
130		funfvbrb 7053	. . 3 ⊢ (Fun (⇝_𝑡‘𝐽) → (𝐺 ∈ dom (⇝_𝑡‘𝐽) ↔ 𝐺(⇝_𝑡‘𝐽)((⇝_𝑡‘𝐽)‘𝐺)))
131	128, 129, 130	3syl 19	. 2 ⊢ (𝜑 → (𝐺 ∈ dom (⇝_𝑡‘𝐽) ↔ 𝐺(⇝_𝑡‘𝐽)((⇝_𝑡‘𝐽)‘𝐺)))
132	125, 131	mpbid 235	1 ⊢ (𝜑 → 𝐺(⇝_𝑡‘𝐽)((⇝_𝑡‘𝐽)‘𝐺))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ≠ wne 2961 ∀wral 3082 ∅c0 4289 {csn 4594 class class class wbr 5114 × cxp 5664 dom cdm 5666 ∘ ccom 5670 Fun wfun 6537 ⟶wf 6539 ‘cfv 6543 (class class class)co 7423 1^st c1st 7993 ℂcc 11116 ℝcr 11117 0cc0 11118 1c1 11119 + caddc 11121 · cmul 11123 < clt 11261 ≤ cle 11262 / cdiv 11889 ℕcn 12251 ℕ₀cn0 12522 ℝ⁺crp 13034 seqcseq 14057 ↑cexp 14117 ∞Metcxmet 21544 Metcmet 21545 MetOpencmopn 21549 ⇝_𝑡clm 23420 Hauscha 23502 Cauccau 25449 CMetccmet 25450

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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-inf2 9620 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-pre-sup 11196

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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-se 5620 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8703 df-map 8835 df-pm 8836 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-inf 9413 df-oi 9482 df-card 9944 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-2 12321 df-3 12322 df-n0 12523 df-z 12610 df-uz 12881 df-q 12991 df-rp 13035 df-xneg 13155 df-xadd 13156 df-xmul 13157 df-ico 13396 df-icc 13397 df-fz 13554 df-fzo 13702 df-fl 13845 df-seq 14058 df-exp 14118 df-hash 14387 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-clim 15565 df-rlim 15566 df-sum 15764 df-rest 17500 df-topgen 17521 df-psmet 21551 df-xmet 21552 df-met 21553 df-bl 21554 df-mopn 21555 df-fbas 21556 df-fg 21557 df-top 23088 df-topon 23105 df-bases 23140 df-ntr 23214 df-nei 23292 df-lm 23423 df-haus 23509 df-fil 24040 df-fm 24132 df-flim 24133 df-flf 24134 df-cfil 25451 df-cau 25452 df-cmet 25453

This theorem is used by: bfplem2 38514

W3C validator