Theorem depindlem1 16488

Description: Lemma for depind 16491. (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
depindlem1	⊢ (𝜑 → (𝐹:ℕ0⟶V ∧ (𝐹‘0) = 𝐴 ∧ ∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛))))

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

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

Proof of Theorem depindlem1

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

Step	Hyp	Ref	Expression
1		nn0uz 9885	. . . 4 ⊢ ℕ0 = (ℤ≥‘0)
2		0zd 9585	. . . 4 ⊢ (𝜑 → 0 ∈ ℤ)
3		nn0ex 9498	. . . . . . 7 ⊢ ℕ0 ∈ V
4	3	mptex 5911	. . . . . 6 ⊢ (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))) ∈ V
5		vex 2815	. . . . . 6 ⊢ 𝑦 ∈ V
6	4, 5	fvex 5689	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘𝑦) ∈ V
7	6	a1i 9	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘𝑦) ∈ V)
8		eqid 2232	. . . . . 6 ⊢ (𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)) = (𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))
9		vex 2815	. . . . . . 7 ⊢ ℎ ∈ V
10		vex 2815	. . . . . . 7 ⊢ 𝑥 ∈ V
11	9, 10	fvex 5689	. . . . . 6 ⊢ (ℎ‘𝑥) ∈ V
12		vex 2815	. . . . . 6 ⊢ 𝑧 ∈ V
13	8, 11, 5, 12	mpofvexi 6401	. . . . 5 ⊢ (𝑦(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))𝑧) ∈ V
14	13	a1i 9	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ V ∧ 𝑧 ∈ V)) → (𝑦(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))𝑧) ∈ V)
15	1, 2, 7, 14	seqf 10822	. . 3 ⊢ (𝜑 → seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))):ℕ0⟶V)
16		depindlem1.4	. . . 4 ⊢ 𝐹 = seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))
17	16	feq1i 5500	. . 3 ⊢ (𝐹:ℕ0⟶V ↔ seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))):ℕ0⟶V)
18	15, 17	sylibr 134	. 2 ⊢ (𝜑 → 𝐹:ℕ0⟶V)
19	16	fveq1i 5670	. . . 4 ⊢ (𝐹‘0) = (seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘0)
20	6	a1i 9	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (ℤ≥‘0)) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘𝑦) ∈ V)
21	2, 20, 14	seq3-1 10820	. . . 4 ⊢ (𝜑 → (seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘0) = ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘0))
22	19, 21	eqtrid 2277	. . 3 ⊢ (𝜑 → (𝐹‘0) = ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘0))
23		0nn0 9507	. . . 4 ⊢ 0 ∈ ℕ0
24		depind.0	. . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝑃‘0))
25		iftrue 3626	. . . . 5 ⊢ (𝑚 = 0 → if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))) = 𝐴)
26		eqid 2232	. . . . 5 ⊢ (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))) = (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))
27	25, 26	fvmptg 5752	. . . 4 ⊢ ((0 ∈ ℕ0 ∧ 𝐴 ∈ (𝑃‘0)) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘0) = 𝐴)
28	23, 24, 27	sylancr 414	. . 3 ⊢ (𝜑 → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘0) = 𝐴)
29	22, 28	eqtrd 2265	. 2 ⊢ (𝜑 → (𝐹‘0) = 𝐴)
30		simpr 110	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0)
31	30, 1	eleqtrdi 2325	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ (ℤ≥‘0))
32	6	a1i 9	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ 𝑦 ∈ (ℤ≥‘0)) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘𝑦) ∈ V)
33	13	a1i 9	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ0) ∧ (𝑦 ∈ V ∧ 𝑧 ∈ V)) → (𝑦(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))𝑧) ∈ V)
34	31, 32, 33	seq3p1 10823	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘(𝑘 + 1)) = ((seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1))))
35	16	fveq1i 5670	. . . . . . 7 ⊢ (𝐹‘(𝑘 + 1)) = (seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘(𝑘 + 1))
36	16	fveq1i 5670	. . . . . . . 8 ⊢ (𝐹‘𝑘) = (seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘𝑘)
37	36	oveq1i 6059	. . . . . . 7 ⊢ ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1))) = ((seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1)))
38	34, 35, 37	3eqtr4g 2290	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘(𝑘 + 1)) = ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1))))
39		eqeq1 2239	. . . . . . . . . 10 ⊢ (𝑚 = (𝑘 + 1) → (𝑚 = 0 ↔ (𝑘 + 1) = 0))
40		fvoveq1 6072	. . . . . . . . . 10 ⊢ (𝑚 = (𝑘 + 1) → (𝐻‘(𝑚 − 1)) = (𝐻‘((𝑘 + 1) − 1)))
41	39, 40	ifbieq2d 3646	. . . . . . . . 9 ⊢ (𝑚 = (𝑘 + 1) → if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))) = if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))))
42		nn0p1nn 9531	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ)
43	42	adantl 277	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℕ)
44	43	nnnn0d 9549	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℕ0)
45	43	nnne0d 9278	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝑘 + 1) ≠ 0)
46	45	neneqd 2433	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ¬ (𝑘 + 1) = 0)
47	46	iffalsed 3631	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))) = (𝐻‘((𝑘 + 1) − 1)))
48	30	nn0cnd 9551	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℂ)
49		pncan1 8646	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℂ → ((𝑘 + 1) − 1) = 𝑘)
50	48, 49	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑘 + 1) − 1) = 𝑘)
51	50	fveq2d 5673	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘((𝑘 + 1) − 1)) = (𝐻‘𝑘))
52	47, 51	eqtrd 2265	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))) = (𝐻‘𝑘))
53		depind.h	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 (𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)))
54		fveq2 5669	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝐻‘𝑛) = (𝐻‘𝑘))
55		fveq2 5669	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝑃‘𝑛) = (𝑃‘𝑘))
56		fvoveq1 6072	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝑃‘(𝑛 + 1)) = (𝑃‘(𝑘 + 1)))
57	54, 55, 56	feq123d 5498	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)) ↔ (𝐻‘𝑘):(𝑃‘𝑘)⟶(𝑃‘(𝑘 + 1))))
58	57	rspccva 2919	. . . . . . . . . . . 12 ⊢ ((∀𝑛 ∈ ℕ0 (𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)) ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘):(𝑃‘𝑘)⟶(𝑃‘(𝑘 + 1)))
59	53, 58	sylan 283	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘):(𝑃‘𝑘)⟶(𝑃‘(𝑘 + 1)))
60		depind.p	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃:ℕ0⟶V)
61	60	ffvelcdmda 5811	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝑃‘𝑘) ∈ V)
62	59, 61	fexd 5915	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘) ∈ V)
63	52, 62	eqeltrd 2309	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))) ∈ V)
64	26, 41, 44, 63	fvmptd3 5770	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1)) = if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))))
65	64, 52	eqtrd 2265	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1)) = (𝐻‘𝑘))
66	65	oveq2d 6065	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1))) = ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))(𝐻‘𝑘)))
67	38, 66	eqtrd 2265	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘(𝑘 + 1)) = ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))(𝐻‘𝑘)))
68	18	ffvelcdmda 5811	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ V)
69		fvexg 5688	. . . . . . 7 ⊢ (((𝐻‘𝑘) ∈ V ∧ (𝐹‘𝑘) ∈ V) → ((𝐻‘𝑘)‘(𝐹‘𝑘)) ∈ V)
70	62, 68, 69	syl2anc 411	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐻‘𝑘)‘(𝐹‘𝑘)) ∈ V)
71		fveq2 5669	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝑘) → (𝑧‘𝑦) = (𝑧‘(𝐹‘𝑘)))
72		fveq1 5668	. . . . . . 7 ⊢ (𝑧 = (𝐻‘𝑘) → (𝑧‘(𝐹‘𝑘)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
73		fveq2 5669	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (ℎ‘𝑥) = (ℎ‘𝑦))
74		fveq1 5668	. . . . . . . 8 ⊢ (ℎ = 𝑧 → (ℎ‘𝑦) = (𝑧‘𝑦))
75	73, 74	cbvmpov 6132	. . . . . . 7 ⊢ (𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)) = (𝑦 ∈ V, 𝑧 ∈ V ↦ (𝑧‘𝑦))
76	71, 72, 75	ovmpog 6187	. . . . . 6 ⊢ (((𝐹‘𝑘) ∈ V ∧ (𝐻‘𝑘) ∈ V ∧ ((𝐻‘𝑘)‘(𝐹‘𝑘)) ∈ V) → ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))(𝐻‘𝑘)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
77	68, 62, 70, 76	syl3anc 1274	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))(𝐻‘𝑘)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
78	67, 77	eqtrd 2265	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
79	78	ralrimiva 2615	. . 3 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
80		fvoveq1 6072	. . . . 5 ⊢ (𝑛 = 𝑘 → (𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1)))
81		fveq2 5669	. . . . . 6 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
82	54, 81	fveq12d 5676	. . . . 5 ⊢ (𝑛 = 𝑘 → ((𝐻‘𝑛)‘(𝐹‘𝑛)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
83	80, 82	eqeq12d 2247	. . . 4 ⊢ (𝑛 = 𝑘 → ((𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛)) ↔ (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘))))
84	83	cbvralvw 2781	. . 3 ⊢ (∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛)) ↔ ∀𝑘 ∈ ℕ0 (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
85	79, 84	sylibr 134	. 2 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛)))
86	18, 29, 85	3jca 1204	1 ⊢ (𝜑 → (𝐹:ℕ0⟶V ∧ (𝐹‘0) = 𝐴 ∧ ∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛))))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1005   = wceq 1398   ∈ wcel 2203  ∀wral 2520  Vcvv 2812  ifcif 3619   ↦ cmpt 4170  ⟶wf 5347  ‘cfv 5351  (class class class)co 6049   ∈ cmpo 6051  ℂcc 8121  0cc0 8123  1c1 8124   + caddc 8126   − cmin 8440  ℕcn 9233  ℕ₀cn0 9492  ℤ_≥cuz 9849  seqcseq 10805

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  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-addcom 8223  ax-addass 8225  ax-distr 8227  ax-i2m1 8228  ax-0lt1 8229  ax-0id 8231  ax-rnegex 8232  ax-cnre 8234  ax-pre-ltirr 8235  ax-pre-ltwlin 8236  ax-pre-lttrn 8237  ax-pre-ltadd 8239

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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  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-if 3620  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-id 4413  df-iord 4486  df-on 4488  df-ilim 4489  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-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-frec 6621  df-pnf 8306  df-mnf 8307  df-xr 8308  df-ltxr 8309  df-le 8310  df-sub 8442  df-neg 8443  df-inn 9234  df-n0 9493  df-z 9574  df-uz 9850  df-seqfrec 10806

This theorem is referenced by:  depindlem2  16489  depindlem3  16490  depind  16491