Theorem caucvgprprlemcbv 7677

Description: Lemma for caucvgprpr 7702. Change bound variables in Cauchy condition. (Contributed by Jim Kingdon, 12-Feb-2021.)

Hypotheses

Ref	Expression
caucvgprpr.f	⊢ (𝜑 → 𝐹:N⟶P)
caucvgprpr.cau	⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))

Assertion

Ref	Expression
caucvgprprlemcbv	⊢ (𝜑 → ∀𝑎 ∈ N ∀𝑏 ∈ N (𝑎 <N 𝑏 → ((𝐹‘𝑎)<P ((𝐹‘𝑏) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑏)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩))))

Distinct variable groups:   𝐹,𝑎,𝑏,𝑘   𝑛,𝐹,𝑎,𝑘   𝑎,𝑙,𝑏,𝑘   𝑢,𝑎,𝑏,𝑘   𝑛,𝑙   𝑢,𝑛

Allowed substitution hints:   𝜑(𝑢,𝑘,𝑛,𝑎,𝑏,𝑙)   𝐹(𝑢,𝑙)

Proof of Theorem caucvgprprlemcbv

Step	Hyp	Ref	Expression
1		caucvgprpr.cau	. 2 ⊢ (𝜑 → ∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))))
2		breq1 4003	. . . 4 ⊢ (𝑛 = 𝑎 → (𝑛 <N 𝑘 ↔ 𝑎 <N 𝑘))
3		fveq2 5511	. . . . . 6 ⊢ (𝑛 = 𝑎 → (𝐹‘𝑛) = (𝐹‘𝑎))
4		opeq1 3776	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑎 → ⟨𝑛, 1o⟩ = ⟨𝑎, 1o⟩)
5	4	eceq1d 6565	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑎 → [⟨𝑛, 1o⟩] ~Q = [⟨𝑎, 1o⟩] ~Q )
6	5	fveq2d 5515	. . . . . . . . . 10 ⊢ (𝑛 = 𝑎 → (*Q‘[⟨𝑛, 1o⟩] ~Q ) = (*Q‘[⟨𝑎, 1o⟩] ~Q ))
7	6	breq2d 4012	. . . . . . . . 9 ⊢ (𝑛 = 𝑎 → (𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q ) ↔ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )))
8	7	abbidv 2295	. . . . . . . 8 ⊢ (𝑛 = 𝑎 → {𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )} = {𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )})
9	6	breq1d 4010	. . . . . . . . 9 ⊢ (𝑛 = 𝑎 → ((*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢 ↔ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢))
10	9	abbidv 2295	. . . . . . . 8 ⊢ (𝑛 = 𝑎 → {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢} = {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢})
11	8, 10	opeq12d 3784	. . . . . . 7 ⊢ (𝑛 = 𝑎 → ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩ = ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩)
12	11	oveq2d 5885	. . . . . 6 ⊢ (𝑛 = 𝑎 → ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) = ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩))
13	3, 12	breq12d 4013	. . . . 5 ⊢ (𝑛 = 𝑎 → ((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ↔ (𝐹‘𝑎)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩)))
14	3, 11	oveq12d 5887	. . . . . 6 ⊢ (𝑛 = 𝑎 → ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) = ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩))
15	14	breq2d 4012	. . . . 5 ⊢ (𝑛 = 𝑎 → ((𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ↔ (𝐹‘𝑘)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩)))
16	13, 15	anbi12d 473	. . . 4 ⊢ (𝑛 = 𝑎 → (((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩)) ↔ ((𝐹‘𝑎)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩))))
17	2, 16	imbi12d 234	. . 3 ⊢ (𝑛 = 𝑎 → ((𝑛 <N 𝑘 → ((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))) ↔ (𝑎 <N 𝑘 → ((𝐹‘𝑎)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩)))))
18		breq2 4004	. . . 4 ⊢ (𝑘 = 𝑏 → (𝑎 <N 𝑘 ↔ 𝑎 <N 𝑏))
19		fveq2 5511	. . . . . . 7 ⊢ (𝑘 = 𝑏 → (𝐹‘𝑘) = (𝐹‘𝑏))
20	19	oveq1d 5884	. . . . . 6 ⊢ (𝑘 = 𝑏 → ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) = ((𝐹‘𝑏) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩))
21	20	breq2d 4012	. . . . 5 ⊢ (𝑘 = 𝑏 → ((𝐹‘𝑎)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ↔ (𝐹‘𝑎)<P ((𝐹‘𝑏) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩)))
22	19	breq1d 4010	. . . . 5 ⊢ (𝑘 = 𝑏 → ((𝐹‘𝑘)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ↔ (𝐹‘𝑏)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩)))
23	21, 22	anbi12d 473	. . . 4 ⊢ (𝑘 = 𝑏 → (((𝐹‘𝑎)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩)) ↔ ((𝐹‘𝑎)<P ((𝐹‘𝑏) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑏)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩))))
24	18, 23	imbi12d 234	. . 3 ⊢ (𝑘 = 𝑏 → ((𝑎 <N 𝑘 → ((𝐹‘𝑎)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩))) ↔ (𝑎 <N 𝑏 → ((𝐹‘𝑎)<P ((𝐹‘𝑏) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑏)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩)))))
25	17, 24	cbvral2v 2716	. 2 ⊢ (∀𝑛 ∈ N ∀𝑘 ∈ N (𝑛 <N 𝑘 → ((𝐹‘𝑛)<P ((𝐹‘𝑘) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑘)<P ((𝐹‘𝑛) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩))) ↔ ∀𝑎 ∈ N ∀𝑏 ∈ N (𝑎 <N 𝑏 → ((𝐹‘𝑎)<P ((𝐹‘𝑏) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑏)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩))))
26	1, 25	sylib 122	1 ⊢ (𝜑 → ∀𝑎 ∈ N ∀𝑏 ∈ N (𝑎 <N 𝑏 → ((𝐹‘𝑎)<P ((𝐹‘𝑏) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩) ∧ (𝐹‘𝑏)<P ((𝐹‘𝑎) +P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑎, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑎, 1o⟩] ~Q ) <Q 𝑢}⟩))))

Syntax hints:   → wi 4   ∧ wa 104  {cab 2163  ∀wral 2455  ⟨cop 3594   class class class wbr 4000  ⟶wf 5208  ‘cfv 5212  (class class class)co 5869  1_oc1o 6404  [cec 6527  Ncnpi 7262   <_N clti 7265   ~_Q ceq 7269  *_Qcrq 7274   <_Q cltq 7275  Pcnp 7281   +_P cpp 7283  <_P cltp 7285

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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-xp 4629  df-cnv 4631  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fv 5220  df-ov 5872  df-ec 6531

This theorem is referenced by:  caucvgprprlemval  7678