Theorem cauappcvgprlemm 7765

Description: Lemma for cauappcvgpr 7782. The putative limit is inhabited. (Contributed by Jim Kingdon, 18-Jul-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 𝑢}⟩

Assertion

Ref	Expression
cauappcvgprlemm	⊢ (𝜑 → (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿)))

Distinct variable groups:   𝐴,𝑝   𝐿,𝑝,𝑞   𝜑,𝑝,𝑞   𝐿,𝑟,𝑠   𝐴,𝑠,𝑝   𝐹,𝑙,𝑢,𝑝,𝑞,𝑟,𝑠   𝜑,𝑟,𝑠

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

Proof of Theorem cauappcvgprlemm

Step	Hyp	Ref	Expression
1		fveq2 5583	. . . . . . 7 ⊢ (𝑝 = 1Q → (𝐹‘𝑝) = (𝐹‘1Q))
2	1	breq2d 4059	. . . . . 6 ⊢ (𝑝 = 1Q → (𝐴 <Q (𝐹‘𝑝) ↔ 𝐴 <Q (𝐹‘1Q)))
3		cauappcvgpr.bnd	. . . . . 6 ⊢ (𝜑 → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝))
4		1nq 7486	. . . . . . 7 ⊢ 1Q ∈ Q
5	4	a1i 9	. . . . . 6 ⊢ (𝜑 → 1Q ∈ Q)
6	2, 3, 5	rspcdva 2883	. . . . 5 ⊢ (𝜑 → 𝐴 <Q (𝐹‘1Q))
7		ltrelnq 7485	. . . . . . 7 ⊢ <Q ⊆ (Q × Q)
8	7	brel 4731	. . . . . 6 ⊢ (𝐴 <Q (𝐹‘1Q) → (𝐴 ∈ Q ∧ (𝐹‘1Q) ∈ Q))
9	8	simpld 112	. . . . 5 ⊢ (𝐴 <Q (𝐹‘1Q) → 𝐴 ∈ Q)
10	6, 9	syl 14	. . . 4 ⊢ (𝜑 → 𝐴 ∈ Q)
11		halfnqq 7530	. . . 4 ⊢ (𝐴 ∈ Q → ∃𝑠 ∈ Q (𝑠 +Q 𝑠) = 𝐴)
12	10, 11	syl 14	. . 3 ⊢ (𝜑 → ∃𝑠 ∈ Q (𝑠 +Q 𝑠) = 𝐴)
13		simplr 528	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → 𝑠 ∈ Q)
14	3	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝))
15		fveq2 5583	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑠 → (𝐹‘𝑝) = (𝐹‘𝑠))
16	15	breq2d 4059	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑠 → (𝐴 <Q (𝐹‘𝑝) ↔ 𝐴 <Q (𝐹‘𝑠)))
17	16	rspcv 2874	. . . . . . . . . 10 ⊢ (𝑠 ∈ Q → (∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝) → 𝐴 <Q (𝐹‘𝑠)))
18	17	ad2antlr 489	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → (∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝) → 𝐴 <Q (𝐹‘𝑠)))
19	14, 18	mpd 13	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → 𝐴 <Q (𝐹‘𝑠))
20		breq1 4050	. . . . . . . . 9 ⊢ ((𝑠 +Q 𝑠) = 𝐴 → ((𝑠 +Q 𝑠) <Q (𝐹‘𝑠) ↔ 𝐴 <Q (𝐹‘𝑠)))
21	20	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → ((𝑠 +Q 𝑠) <Q (𝐹‘𝑠) ↔ 𝐴 <Q (𝐹‘𝑠)))
22	19, 21	mpbird 167	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → (𝑠 +Q 𝑠) <Q (𝐹‘𝑠))
23		oveq2 5959	. . . . . . . . 9 ⊢ (𝑞 = 𝑠 → (𝑠 +Q 𝑞) = (𝑠 +Q 𝑠))
24		fveq2 5583	. . . . . . . . 9 ⊢ (𝑞 = 𝑠 → (𝐹‘𝑞) = (𝐹‘𝑠))
25	23, 24	breq12d 4060	. . . . . . . 8 ⊢ (𝑞 = 𝑠 → ((𝑠 +Q 𝑞) <Q (𝐹‘𝑞) ↔ (𝑠 +Q 𝑠) <Q (𝐹‘𝑠)))
26	25	rspcev 2878	. . . . . . 7 ⊢ ((𝑠 ∈ Q ∧ (𝑠 +Q 𝑠) <Q (𝐹‘𝑠)) → ∃𝑞 ∈ Q (𝑠 +Q 𝑞) <Q (𝐹‘𝑞))
27	13, 22, 26	syl2anc 411	. . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → ∃𝑞 ∈ Q (𝑠 +Q 𝑞) <Q (𝐹‘𝑞))
28		oveq1 5958	. . . . . . . . 9 ⊢ (𝑙 = 𝑠 → (𝑙 +Q 𝑞) = (𝑠 +Q 𝑞))
29	28	breq1d 4057	. . . . . . . 8 ⊢ (𝑙 = 𝑠 → ((𝑙 +Q 𝑞) <Q (𝐹‘𝑞) ↔ (𝑠 +Q 𝑞) <Q (𝐹‘𝑞)))
30	29	rexbidv 2508	. . . . . . 7 ⊢ (𝑙 = 𝑠 → (∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞) ↔ ∃𝑞 ∈ Q (𝑠 +Q 𝑞) <Q (𝐹‘𝑞)))
31		cauappcvgpr.lim	. . . . . . . . 9 ⊢ 𝐿 = ⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩
32	31	fveq2i 5586	. . . . . . . 8 ⊢ (1st ‘𝐿) = (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩)
33		nqex 7483	. . . . . . . . . 10 ⊢ Q ∈ V
34	33	rabex 4192	. . . . . . . . 9 ⊢ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ∈ V
35	33	rabex 4192	. . . . . . . . 9 ⊢ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ∈ V
36	34, 35	op1st 6239	. . . . . . . 8 ⊢ (1st ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩) = {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}
37	32, 36	eqtri 2227	. . . . . . 7 ⊢ (1st ‘𝐿) = {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}
38	30, 37	elrab2 2933	. . . . . 6 ⊢ (𝑠 ∈ (1st ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑞 ∈ Q (𝑠 +Q 𝑞) <Q (𝐹‘𝑞)))
39	13, 27, 38	sylanbrc 417	. . . . 5 ⊢ (((𝜑 ∧ 𝑠 ∈ Q) ∧ (𝑠 +Q 𝑠) = 𝐴) → 𝑠 ∈ (1st ‘𝐿))
40	39	ex 115	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ Q) → ((𝑠 +Q 𝑠) = 𝐴 → 𝑠 ∈ (1st ‘𝐿)))
41	40	reximdva 2609	. . 3 ⊢ (𝜑 → (∃𝑠 ∈ Q (𝑠 +Q 𝑠) = 𝐴 → ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿)))
42	12, 41	mpd 13	. 2 ⊢ (𝜑 → ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿))
43		cauappcvgpr.f	. . . . . 6 ⊢ (𝜑 → 𝐹:Q⟶Q)
44	43, 5	ffvelcdmd 5723	. . . . 5 ⊢ (𝜑 → (𝐹‘1Q) ∈ Q)
45		addclnq 7495	. . . . 5 ⊢ (((𝐹‘1Q) ∈ Q ∧ 1Q ∈ Q) → ((𝐹‘1Q) +Q 1Q) ∈ Q)
46	44, 5, 45	syl2anc 411	. . . 4 ⊢ (𝜑 → ((𝐹‘1Q) +Q 1Q) ∈ Q)
47		addclnq 7495	. . . 4 ⊢ ((((𝐹‘1Q) +Q 1Q) ∈ Q ∧ 1Q ∈ Q) → (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ Q)
48	46, 5, 47	syl2anc 411	. . 3 ⊢ (𝜑 → (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ Q)
49		ltaddnq 7527	. . . . . 6 ⊢ ((((𝐹‘1Q) +Q 1Q) ∈ Q ∧ 1Q ∈ Q) → ((𝐹‘1Q) +Q 1Q) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q))
50	46, 5, 49	syl2anc 411	. . . . 5 ⊢ (𝜑 → ((𝐹‘1Q) +Q 1Q) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q))
51		fveq2 5583	. . . . . . . 8 ⊢ (𝑞 = 1Q → (𝐹‘𝑞) = (𝐹‘1Q))
52		id 19	. . . . . . . 8 ⊢ (𝑞 = 1Q → 𝑞 = 1Q)
53	51, 52	oveq12d 5969	. . . . . . 7 ⊢ (𝑞 = 1Q → ((𝐹‘𝑞) +Q 𝑞) = ((𝐹‘1Q) +Q 1Q))
54	53	breq1d 4057	. . . . . 6 ⊢ (𝑞 = 1Q → (((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q) ↔ ((𝐹‘1Q) +Q 1Q) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)))
55	54	rspcev 2878	. . . . 5 ⊢ ((1Q ∈ Q ∧ ((𝐹‘1Q) +Q 1Q) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q))
56	5, 50, 55	syl2anc 411	. . . 4 ⊢ (𝜑 → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q))
57		breq2 4051	. . . . . 6 ⊢ (𝑢 = (((𝐹‘1Q) +Q 1Q) +Q 1Q) → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)))
58	57	rexbidv 2508	. . . . 5 ⊢ (𝑢 = (((𝐹‘1Q) +Q 1Q) +Q 1Q) → (∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)))
59	31	fveq2i 5586	. . . . . 6 ⊢ (2nd ‘𝐿) = (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩)
60	34, 35	op2nd 6240	. . . . . 6 ⊢ (2nd ‘⟨{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}⟩) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}
61	59, 60	eqtri 2227	. . . . 5 ⊢ (2nd ‘𝐿) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}
62	58, 61	elrab2 2933	. . . 4 ⊢ ((((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ (2nd ‘𝐿) ↔ ((((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ Q ∧ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q (((𝐹‘1Q) +Q 1Q) +Q 1Q)))
63	48, 56, 62	sylanbrc 417	. . 3 ⊢ (𝜑 → (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ (2nd ‘𝐿))
64		eleq1 2269	. . . 4 ⊢ (𝑟 = (((𝐹‘1Q) +Q 1Q) +Q 1Q) → (𝑟 ∈ (2nd ‘𝐿) ↔ (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ (2nd ‘𝐿)))
65	64	rspcev 2878	. . 3 ⊢ (((((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ Q ∧ (((𝐹‘1Q) +Q 1Q) +Q 1Q) ∈ (2nd ‘𝐿)) → ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))
66	48, 63, 65	syl2anc 411	. 2 ⊢ (𝜑 → ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))
67	42, 66	jca 306	1 ⊢ (𝜑 → (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1373   ∈ wcel 2177  ∀wral 2485  ∃wrex 2486  {crab 2489  ⟨cop 3637   class class class wbr 4047  ⟶wf 5272  ‘cfv 5276  (class class class)co 5951  1^st c1st 6231  2^nd c2nd 6232  Qcnq 7400  1_Qc1q 7401   +_Q cplq 7402   <_Q cltq 7405

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-nul 4174  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-iinf 4640

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-tr 4147  df-eprel 4340  df-id 4344  df-iord 4417  df-on 4419  df-suc 4422  df-iom 4643  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-ov 5954  df-oprab 5955  df-mpo 5956  df-1st 6233  df-2nd 6234  df-recs 6398  df-irdg 6463  df-1o 6509  df-oadd 6513  df-omul 6514  df-er 6627  df-ec 6629  df-qs 6633  df-ni 7424  df-pli 7425  df-mi 7426  df-lti 7427  df-plpq 7464  df-mpq 7465  df-enq 7467  df-nqqs 7468  df-plqqs 7469  df-mqqs 7470  df-1nqqs 7471  df-rq 7472  df-ltnqqs 7473

This theorem is referenced by:  cauappcvgprlemcl  7773