Theorem depindlem2 16631

Description: Lemma for depind 16633. (Contributed by Matthew House, 14-Apr-2026.)

Hypotheses

Ref	Expression
depind.p	⊢ (𝜑 → 𝑃:ℕ0⟶V)
depind.0	⊢ (𝜑 → 𝐴 ∈ (𝑃‘0))
depind.h	⊢ (𝜑 → ∀𝑛 ∈ ℕ0 (𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)))
depindlem1.4	⊢ 𝐹 = seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))

Assertion

Ref	Expression
depindlem2	⊢ (𝜑 → 𝐹 ∈ X𝑛 ∈ ℕ0 (𝑃‘𝑛))

Distinct variable groups:   ℎ,𝑛,𝑥   𝐴,𝑚,𝑛   𝑛,𝐹   𝑚,𝐻,𝑛   𝑃,𝑛

Allowed substitution hints:   𝜑(𝑥,ℎ,𝑚,𝑛)   𝐴(𝑥,ℎ)   𝑃(𝑥,ℎ,𝑚)   𝐹(𝑥,ℎ,𝑚)   𝐻(𝑥,ℎ)

Proof of Theorem depindlem2

Dummy variables 𝑦 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		depind.p	. . . . . 6 ⊢ (𝜑 → 𝑃:ℕ0⟶V)
2		depind.0	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝑃‘0))
3		depind.h	. . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 (𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)))
4		depindlem1.4	. . . . . 6 ⊢ 𝐹 = seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))
5	1, 2, 3, 4	depindlem1 16630	. . . . 5 ⊢ (𝜑 → (𝐹:ℕ0⟶V ∧ (𝐹‘0) = 𝐴 ∧ ∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛))))
6	5	simp1d 1036	. . . 4 ⊢ (𝜑 → 𝐹:ℕ0⟶V)
7		nn0ex 9522	. . . . 5 ⊢ ℕ0 ∈ V
8	7	a1i 9	. . . 4 ⊢ (𝜑 → ℕ0 ∈ V)
9	6, 8	fexd 5921	. . 3 ⊢ (𝜑 → 𝐹 ∈ V)
10	6	ffnd 5514	. . 3 ⊢ (𝜑 → 𝐹 Fn ℕ0)
11		fveq2 5675	. . . . . . . 8 ⊢ (𝑦 = 0 → (𝐹‘𝑦) = (𝐹‘0))
12		fveq2 5675	. . . . . . . 8 ⊢ (𝑦 = 0 → (𝑃‘𝑦) = (𝑃‘0))
13	11, 12	eleq12d 2305	. . . . . . 7 ⊢ (𝑦 = 0 → ((𝐹‘𝑦) ∈ (𝑃‘𝑦) ↔ (𝐹‘0) ∈ (𝑃‘0)))
14	13	imbi2d 230	. . . . . 6 ⊢ (𝑦 = 0 → ((𝜑 → (𝐹‘𝑦) ∈ (𝑃‘𝑦)) ↔ (𝜑 → (𝐹‘0) ∈ (𝑃‘0))))
15		fveq2 5675	. . . . . . . 8 ⊢ (𝑦 = 𝑘 → (𝐹‘𝑦) = (𝐹‘𝑘))
16		fveq2 5675	. . . . . . . 8 ⊢ (𝑦 = 𝑘 → (𝑃‘𝑦) = (𝑃‘𝑘))
17	15, 16	eleq12d 2305	. . . . . . 7 ⊢ (𝑦 = 𝑘 → ((𝐹‘𝑦) ∈ (𝑃‘𝑦) ↔ (𝐹‘𝑘) ∈ (𝑃‘𝑘)))
18	17	imbi2d 230	. . . . . 6 ⊢ (𝑦 = 𝑘 → ((𝜑 → (𝐹‘𝑦) ∈ (𝑃‘𝑦)) ↔ (𝜑 → (𝐹‘𝑘) ∈ (𝑃‘𝑘))))
19		fveq2 5675	. . . . . . . 8 ⊢ (𝑦 = (𝑘 + 1) → (𝐹‘𝑦) = (𝐹‘(𝑘 + 1)))
20		fveq2 5675	. . . . . . . 8 ⊢ (𝑦 = (𝑘 + 1) → (𝑃‘𝑦) = (𝑃‘(𝑘 + 1)))
21	19, 20	eleq12d 2305	. . . . . . 7 ⊢ (𝑦 = (𝑘 + 1) → ((𝐹‘𝑦) ∈ (𝑃‘𝑦) ↔ (𝐹‘(𝑘 + 1)) ∈ (𝑃‘(𝑘 + 1))))
22	21	imbi2d 230	. . . . . 6 ⊢ (𝑦 = (𝑘 + 1) → ((𝜑 → (𝐹‘𝑦) ∈ (𝑃‘𝑦)) ↔ (𝜑 → (𝐹‘(𝑘 + 1)) ∈ (𝑃‘(𝑘 + 1)))))
23	5	simp2d 1037	. . . . . . 7 ⊢ (𝜑 → (𝐹‘0) = 𝐴)
24	23, 2	eqeltrd 2311	. . . . . 6 ⊢ (𝜑 → (𝐹‘0) ∈ (𝑃‘0))
25	5	simp3d 1038	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛)))
26		fvoveq1 6081	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1)))
27		fveq2 5675	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑘 → (𝐻‘𝑛) = (𝐻‘𝑘))
28		fveq2 5675	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
29	27, 28	fveq12d 5682	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → ((𝐻‘𝑛)‘(𝐹‘𝑛)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
30	26, 29	eqeq12d 2249	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛)) ↔ (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘))))
31	30	rspccva 2922	. . . . . . . . . . . 12 ⊢ ((∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛)) ∧ 𝑘 ∈ ℕ0) → (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
32	25, 31	sylan 283	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
33	32	adantr 276	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ (𝐹‘𝑘) ∈ (𝑃‘𝑘)) → (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
34		fveq2 5675	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝑃‘𝑛) = (𝑃‘𝑘))
35		fvoveq1 6081	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝑃‘(𝑛 + 1)) = (𝑃‘(𝑘 + 1)))
36	27, 34, 35	feq123d 5504	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)) ↔ (𝐻‘𝑘):(𝑃‘𝑘)⟶(𝑃‘(𝑘 + 1))))
37	36	rspccva 2922	. . . . . . . . . . . 12 ⊢ ((∀𝑛 ∈ ℕ0 (𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)) ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘):(𝑃‘𝑘)⟶(𝑃‘(𝑘 + 1)))
38	3, 37	sylan 283	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘):(𝑃‘𝑘)⟶(𝑃‘(𝑘 + 1)))
39	38	ffvelcdmda 5817	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ (𝐹‘𝑘) ∈ (𝑃‘𝑘)) → ((𝐻‘𝑘)‘(𝐹‘𝑘)) ∈ (𝑃‘(𝑘 + 1)))
40	33, 39	eqeltrd 2311	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ (𝐹‘𝑘) ∈ (𝑃‘𝑘)) → (𝐹‘(𝑘 + 1)) ∈ (𝑃‘(𝑘 + 1)))
41	40	exp31 364	. . . . . . . 8 ⊢ (𝜑 → (𝑘 ∈ ℕ0 → ((𝐹‘𝑘) ∈ (𝑃‘𝑘) → (𝐹‘(𝑘 + 1)) ∈ (𝑃‘(𝑘 + 1)))))
42	41	com12 30	. . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → (𝜑 → ((𝐹‘𝑘) ∈ (𝑃‘𝑘) → (𝐹‘(𝑘 + 1)) ∈ (𝑃‘(𝑘 + 1)))))
43	42	a2d 26	. . . . . 6 ⊢ (𝑘 ∈ ℕ0 → ((𝜑 → (𝐹‘𝑘) ∈ (𝑃‘𝑘)) → (𝜑 → (𝐹‘(𝑘 + 1)) ∈ (𝑃‘(𝑘 + 1)))))
44	14, 18, 22, 18, 24, 43	nn0ind 9713	. . . . 5 ⊢ (𝑘 ∈ ℕ0 → (𝜑 → (𝐹‘𝑘) ∈ (𝑃‘𝑘)))
45	44	impcom 125	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ (𝑃‘𝑘))
46	45	ralrimiva 2617	. . 3 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝐹‘𝑘) ∈ (𝑃‘𝑘))
47		elixp2 6950	. . 3 ⊢ (𝐹 ∈ X𝑘 ∈ ℕ0 (𝑃‘𝑘) ↔ (𝐹 ∈ V ∧ 𝐹 Fn ℕ0 ∧ ∀𝑘 ∈ ℕ0 (𝐹‘𝑘) ∈ (𝑃‘𝑘)))
48	9, 10, 46, 47	syl3anbrc 1208	. 2 ⊢ (𝜑 → 𝐹 ∈ X𝑘 ∈ ℕ0 (𝑃‘𝑘))
49	34	cbvixpv 6964	. 2 ⊢ X𝑛 ∈ ℕ0 (𝑃‘𝑛) = X𝑘 ∈ ℕ0 (𝑃‘𝑘)
50	48, 49	eleqtrrdi 2328	1 ⊢ (𝜑 → 𝐹 ∈ X𝑛 ∈ ℕ0 (𝑃‘𝑛))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2205  ∀wral 2522  Vcvv 2815  ifcif 3624   ↦ cmpt 4176   Fn wfn 5352  ⟶wf 5353  ‘cfv 5357  (class class class)co 6058   ∈ cmpo 6060  Xcixp 6946  0cc0 8143  1c1 8144   + caddc 8146   − cmin 8461  ℕ₀cn0 9516  seqcseq 10836

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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-ixp 6947  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8463  df-neg 8464  df-inn 9258  df-n0 9517  df-z 9598  df-uz 9875  df-seqfrec 10837

This theorem is referenced by:  depind  16633