Theorem cauappcvgprlem1 7970

Description: Lemma for cauappcvgpr 7973. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 23-Jun-2020.)

Hypotheses

Ref	Expression
cauappcvgpr.f	⊢ (𝜑 → 𝐹:Q⟶Q)
cauappcvgpr.app	⊢ (𝜑 → ∀𝑝 ∈ Q ∀𝑞 ∈ Q ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞))))
cauappcvgpr.bnd	⊢ (𝜑 → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝))
cauappcvgpr.lim	⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩
cauappcvgprlem.q	⊢ (𝜑 → 𝑄 ∈ Q)
cauappcvgprlem.r	⊢ (𝜑 → 𝑅 ∈ Q)

Assertion

Ref	Expression
cauappcvgprlem1	⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑄)}, {𝑢 ∣ (𝐹‘𝑄) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩))

Distinct variable groups:   𝐴,𝑝   𝐿,𝑝,𝑞   𝜑,𝑝,𝑞   𝐹,𝑝,𝑞,𝑙,𝑢   𝑄,𝑝,𝑞,𝑙,𝑢   𝑅,𝑝,𝑞,𝑙,𝑢

Allowed substitution hints:   𝜑(𝑢,𝑙)   𝐴(𝑢,𝑞,𝑙)   𝐿(𝑢,𝑙)

Proof of Theorem cauappcvgprlem1

Dummy variables 𝑓 𝑔 ℎ 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cauappcvgprlem.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Q)
2		halfnqq 7721	. . . . 5 ⊢ (𝑅 ∈ Q → ∃𝑥 ∈ Q (𝑥 +Q 𝑥) = 𝑅)
3	1, 2	syl 14	. . . 4 ⊢ (𝜑 → ∃𝑥 ∈ Q (𝑥 +Q 𝑥) = 𝑅)
4		simprl 531	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → 𝑥 ∈ Q)
5		cauappcvgpr.app	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑝 ∈ Q ∀𝑞 ∈ Q ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞))))
6	5	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → ∀𝑝 ∈ Q ∀𝑞 ∈ Q ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞))))
7		cauappcvgprlem.q	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑄 ∈ Q)
8	7	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → 𝑄 ∈ Q)
9		fveq2 5669	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑄 → (𝐹‘𝑝) = (𝐹‘𝑄))
10		oveq1 6056	. . . . . . . . . . . . . . 15 ⊢ (𝑝 = 𝑄 → (𝑝 +Q 𝑞) = (𝑄 +Q 𝑞))
11	10	oveq2d 6065	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑄 → ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) = ((𝐹‘𝑞) +Q (𝑄 +Q 𝑞)))
12	9, 11	breq12d 4121	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑄 → ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ↔ (𝐹‘𝑄) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑞))))
13	9, 10	oveq12d 6067	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑄 → ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞)) = ((𝐹‘𝑄) +Q (𝑄 +Q 𝑞)))
14	13	breq2d 4120	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑄 → ((𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞)) ↔ (𝐹‘𝑞) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑞))))
15	12, 14	anbi12d 473	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑄 → (((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞))) ↔ ((𝐹‘𝑄) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑞)))))
16		fveq2 5669	. . . . . . . . . . . . . . 15 ⊢ (𝑞 = 𝑥 → (𝐹‘𝑞) = (𝐹‘𝑥))
17		oveq2 6057	. . . . . . . . . . . . . . 15 ⊢ (𝑞 = 𝑥 → (𝑄 +Q 𝑞) = (𝑄 +Q 𝑥))
18	16, 17	oveq12d 6067	. . . . . . . . . . . . . 14 ⊢ (𝑞 = 𝑥 → ((𝐹‘𝑞) +Q (𝑄 +Q 𝑞)) = ((𝐹‘𝑥) +Q (𝑄 +Q 𝑥)))
19	18	breq2d 4120	. . . . . . . . . . . . 13 ⊢ (𝑞 = 𝑥 → ((𝐹‘𝑄) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑞)) ↔ (𝐹‘𝑄) <Q ((𝐹‘𝑥) +Q (𝑄 +Q 𝑥))))
20	17	oveq2d 6065	. . . . . . . . . . . . . 14 ⊢ (𝑞 = 𝑥 → ((𝐹‘𝑄) +Q (𝑄 +Q 𝑞)) = ((𝐹‘𝑄) +Q (𝑄 +Q 𝑥)))
21	16, 20	breq12d 4121	. . . . . . . . . . . . 13 ⊢ (𝑞 = 𝑥 → ((𝐹‘𝑞) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑞)) ↔ (𝐹‘𝑥) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑥))))
22	19, 21	anbi12d 473	. . . . . . . . . . . 12 ⊢ (𝑞 = 𝑥 → (((𝐹‘𝑄) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑞))) ↔ ((𝐹‘𝑄) <Q ((𝐹‘𝑥) +Q (𝑄 +Q 𝑥)) ∧ (𝐹‘𝑥) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑥)))))
23	15, 22	rspc2v 2933	. . . . . . . . . . 11 ⊢ ((𝑄 ∈ Q ∧ 𝑥 ∈ Q) → (∀𝑝 ∈ Q ∀𝑞 ∈ Q ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞))) → ((𝐹‘𝑄) <Q ((𝐹‘𝑥) +Q (𝑄 +Q 𝑥)) ∧ (𝐹‘𝑥) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑥)))))
24	8, 4, 23	syl2anc 411	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (∀𝑝 ∈ Q ∀𝑞 ∈ Q ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞))) → ((𝐹‘𝑄) <Q ((𝐹‘𝑥) +Q (𝑄 +Q 𝑥)) ∧ (𝐹‘𝑥) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑥)))))
25	6, 24	mpd 13	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → ((𝐹‘𝑄) <Q ((𝐹‘𝑥) +Q (𝑄 +Q 𝑥)) ∧ (𝐹‘𝑥) <Q ((𝐹‘𝑄) +Q (𝑄 +Q 𝑥))))
26	25	simpld 112	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (𝐹‘𝑄) <Q ((𝐹‘𝑥) +Q (𝑄 +Q 𝑥)))
27		cauappcvgpr.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:Q⟶Q)
28	27	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → 𝐹:Q⟶Q)
29	28, 4	ffvelcdmd 5812	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (𝐹‘𝑥) ∈ Q)
30		addassnqg 7693	. . . . . . . . 9 ⊢ (((𝐹‘𝑥) ∈ Q ∧ 𝑄 ∈ Q ∧ 𝑥 ∈ Q) → (((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) = ((𝐹‘𝑥) +Q (𝑄 +Q 𝑥)))
31	29, 8, 4, 30	syl3anc 1274	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) = ((𝐹‘𝑥) +Q (𝑄 +Q 𝑥)))
32	26, 31	breqtrrd 4136	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (𝐹‘𝑄) <Q (((𝐹‘𝑥) +Q 𝑄) +Q 𝑥))
33		ltanqg 7711	. . . . . . . . 9 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑓 <Q 𝑔 ↔ (ℎ +Q 𝑓) <Q (ℎ +Q 𝑔)))
34	33	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q)) → (𝑓 <Q 𝑔 ↔ (ℎ +Q 𝑓) <Q (ℎ +Q 𝑔)))
35	27, 7	ffvelcdmd 5812	. . . . . . . . 9 ⊢ (𝜑 → (𝐹‘𝑄) ∈ Q)
36	35	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (𝐹‘𝑄) ∈ Q)
37		addclnq 7686	. . . . . . . . . 10 ⊢ (((𝐹‘𝑥) ∈ Q ∧ 𝑄 ∈ Q) → ((𝐹‘𝑥) +Q 𝑄) ∈ Q)
38	29, 8, 37	syl2anc 411	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → ((𝐹‘𝑥) +Q 𝑄) ∈ Q)
39		addclnq 7686	. . . . . . . . 9 ⊢ ((((𝐹‘𝑥) +Q 𝑄) ∈ Q ∧ 𝑥 ∈ Q) → (((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) ∈ Q)
40	38, 4, 39	syl2anc 411	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) ∈ Q)
41		addcomnqg 7692	. . . . . . . . 9 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → (𝑓 +Q 𝑔) = (𝑔 +Q 𝑓))
42	41	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q)) → (𝑓 +Q 𝑔) = (𝑔 +Q 𝑓))
43	34, 36, 40, 4, 42	caovord2d 6223	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → ((𝐹‘𝑄) <Q (((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) ↔ ((𝐹‘𝑄) +Q 𝑥) <Q ((((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) +Q 𝑥)))
44	32, 43	mpbid 147	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → ((𝐹‘𝑄) +Q 𝑥) <Q ((((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) +Q 𝑥))
45		addassnqg 7693	. . . . . . . 8 ⊢ ((((𝐹‘𝑥) +Q 𝑄) ∈ Q ∧ 𝑥 ∈ Q ∧ 𝑥 ∈ Q) → ((((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) +Q 𝑥) = (((𝐹‘𝑥) +Q 𝑄) +Q (𝑥 +Q 𝑥)))
46	38, 4, 4, 45	syl3anc 1274	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → ((((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) +Q 𝑥) = (((𝐹‘𝑥) +Q 𝑄) +Q (𝑥 +Q 𝑥)))
47		simprr 533	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (𝑥 +Q 𝑥) = 𝑅)
48	47	oveq2d 6065	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (((𝐹‘𝑥) +Q 𝑄) +Q (𝑥 +Q 𝑥)) = (((𝐹‘𝑥) +Q 𝑄) +Q 𝑅))
49	1	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → 𝑅 ∈ Q)
50		addassnqg 7693	. . . . . . . 8 ⊢ (((𝐹‘𝑥) ∈ Q ∧ 𝑄 ∈ Q ∧ 𝑅 ∈ Q) → (((𝐹‘𝑥) +Q 𝑄) +Q 𝑅) = ((𝐹‘𝑥) +Q (𝑄 +Q 𝑅)))
51	29, 8, 49, 50	syl3anc 1274	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → (((𝐹‘𝑥) +Q 𝑄) +Q 𝑅) = ((𝐹‘𝑥) +Q (𝑄 +Q 𝑅)))
52	46, 48, 51	3eqtrd 2269	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → ((((𝐹‘𝑥) +Q 𝑄) +Q 𝑥) +Q 𝑥) = ((𝐹‘𝑥) +Q (𝑄 +Q 𝑅)))
53	44, 52	breqtrd 4134	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → ((𝐹‘𝑄) +Q 𝑥) <Q ((𝐹‘𝑥) +Q (𝑄 +Q 𝑅)))
54		oveq2 6057	. . . . . . 7 ⊢ (𝑞 = 𝑥 → ((𝐹‘𝑄) +Q 𝑞) = ((𝐹‘𝑄) +Q 𝑥))
55	16	oveq1d 6064	. . . . . . 7 ⊢ (𝑞 = 𝑥 → ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅)) = ((𝐹‘𝑥) +Q (𝑄 +Q 𝑅)))
56	54, 55	breq12d 4121	. . . . . 6 ⊢ (𝑞 = 𝑥 → (((𝐹‘𝑄) +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅)) ↔ ((𝐹‘𝑄) +Q 𝑥) <Q ((𝐹‘𝑥) +Q (𝑄 +Q 𝑅))))
57	56	rspcev 2920	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ ((𝐹‘𝑄) +Q 𝑥) <Q ((𝐹‘𝑥) +Q (𝑄 +Q 𝑅))) → ∃𝑞 ∈ Q ((𝐹‘𝑄) +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅)))
58	4, 53, 57	syl2anc 411	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ Q ∧ (𝑥 +Q 𝑥) = 𝑅)) → ∃𝑞 ∈ Q ((𝐹‘𝑄) +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅)))
59	3, 58	rexlimddv 2665	. . 3 ⊢ (𝜑 → ∃𝑞 ∈ Q ((𝐹‘𝑄) +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅)))
60		cauappcvgpr.bnd	. . . . . . . 8 ⊢ (𝜑 → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝))
61		cauappcvgpr.lim	. . . . . . . 8 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩
62		addclnq 7686	. . . . . . . . 9 ⊢ ((𝑄 ∈ Q ∧ 𝑅 ∈ Q) → (𝑄 +Q 𝑅) ∈ Q)
63	7, 1, 62	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → (𝑄 +Q 𝑅) ∈ Q)
64	27, 5, 60, 61, 63	cauappcvgprlemladd 7969	. . . . . . 7 ⊢ (𝜑 → (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩) = ⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q (((𝐹‘𝑞) +Q 𝑞) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩)
65	64	fveq2d 5673	. . . . . 6 ⊢ (𝜑 → (1st ‘(𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩)) = (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q (((𝐹‘𝑞) +Q 𝑞) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩))
66		nqex 7674	. . . . . . . 8 ⊢ Q ∈ V
67	66	rabex 4255	. . . . . . 7 ⊢ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))} ∈ V
68	66	rabex 4255	. . . . . . 7 ⊢ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q (((𝐹‘𝑞) +Q 𝑞) +Q (𝑄 +Q 𝑅)) <Q 𝑢} ∈ V
69	67, 68	op1st 6339	. . . . . 6 ⊢ (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q (((𝐹‘𝑞) +Q 𝑞) +Q (𝑄 +Q 𝑅)) <Q 𝑢}⟩) = {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))}
70	65, 69	eqtrdi 2281	. . . . 5 ⊢ (𝜑 → (1st ‘(𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩)) = {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))})
71	70	eleq2d 2302	. . . 4 ⊢ (𝜑 → ((𝐹‘𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩)) ↔ (𝐹‘𝑄) ∈ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))}))
72		oveq1 6056	. . . . . . . 8 ⊢ (𝑙 = (𝐹‘𝑄) → (𝑙 +Q 𝑞) = ((𝐹‘𝑄) +Q 𝑞))
73	72	breq1d 4118	. . . . . . 7 ⊢ (𝑙 = (𝐹‘𝑄) → ((𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅)) ↔ ((𝐹‘𝑄) +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))))
74	73	rexbidv 2543	. . . . . 6 ⊢ (𝑙 = (𝐹‘𝑄) → (∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅)) ↔ ∃𝑞 ∈ Q ((𝐹‘𝑄) +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))))
75	74	elrab3 2973	. . . . 5 ⊢ ((𝐹‘𝑄) ∈ Q → ((𝐹‘𝑄) ∈ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))} ↔ ∃𝑞 ∈ Q ((𝐹‘𝑄) +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))))
76	35, 75	syl 14	. . . 4 ⊢ (𝜑 → ((𝐹‘𝑄) ∈ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))} ↔ ∃𝑞 ∈ Q ((𝐹‘𝑄) +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))))
77	71, 76	bitrd 188	. . 3 ⊢ (𝜑 → ((𝐹‘𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩)) ↔ ∃𝑞 ∈ Q ((𝐹‘𝑄) +Q 𝑞) <Q ((𝐹‘𝑞) +Q (𝑄 +Q 𝑅))))
78	59, 77	mpbird 167	. 2 ⊢ (𝜑 → (𝐹‘𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩)))
79	27, 5, 60, 61	cauappcvgprlemcl 7964	. . . 4 ⊢ (𝜑 → 𝐿 ∈ P)
80		nqprlu 7858	. . . . 5 ⊢ ((𝑄 +Q 𝑅) ∈ Q → ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩ ∈ P)
81	63, 80	syl 14	. . . 4 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩ ∈ P)
82		addclpr 7848	. . . 4 ⊢ ((𝐿 ∈ P ∧ ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩ ∈ P) → (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩) ∈ P)
83	79, 81, 82	syl2anc 411	. . 3 ⊢ (𝜑 → (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩) ∈ P)
84		nqprl 7862	. . 3 ⊢ (((𝐹‘𝑄) ∈ Q ∧ (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩) ∈ P) → ((𝐹‘𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩)) ↔ ⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑄)}, {𝑢 ∣ (𝐹‘𝑄) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩)))
85	35, 83, 84	syl2anc 411	. 2 ⊢ (𝜑 → ((𝐹‘𝑄) ∈ (1st ‘(𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩)) ↔ ⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑄)}, {𝑢 ∣ (𝐹‘𝑄) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩)))
86	78, 85	mpbid 147	1 ⊢ (𝜑 → ⟨{𝑙 ∣ 𝑙 <Q (𝐹‘𝑄)}, {𝑢 ∣ (𝐹‘𝑄) <Q 𝑢}⟩<P (𝐿 +P ⟨{𝑙 ∣ 𝑙 <Q (𝑄 +Q 𝑅)}, {𝑢 ∣ (𝑄 +Q 𝑅) <Q 𝑢}⟩))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1005   = wceq 1398   ∈ wcel 2203  {cab 2218  ∀wral 2520  ∃wrex 2521  {crab 2524  ⟨cop 3691   class class class wbr 4108  ⟶wf 5347  ‘cfv 5351  (class class class)co 6049  1^st c1st 6331  Qcnq 7591   +_Q cplq 7593   <_Q cltq 7596  Pcnp 7602   +_P cpp 7604  <_P cltp 7606

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-eprel 4409  df-id 4413  df-po 4416  df-iso 4417  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-irdg 6600  df-1o 6646  df-2o 6647  df-oadd 6650  df-omul 6651  df-er 6766  df-ec 6768  df-qs 6772  df-ni 7615  df-pli 7616  df-mi 7617  df-lti 7618  df-plpq 7655  df-mpq 7656  df-enq 7658  df-nqqs 7659  df-plqqs 7660  df-mqqs 7661  df-1nqqs 7662  df-rq 7663  df-ltnqqs 7664  df-enq0 7735  df-nq0 7736  df-0nq0 7737  df-plq0 7738  df-mq0 7739  df-inp 7777  df-iplp 7779  df-iltp 7781

This theorem is referenced by:  cauappcvgprlemlim  7972