Theorem depindlem1 16759

Description: Lemma for depind 16762. (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 9959	. . . 4 ⊢ ℕ0 = (ℤ≥‘0)
2		0zd 9658	. . . 4 ⊢ (𝜑 → 0 ∈ ℤ)
3		nn0ex 9571	. . . . . . 7 ⊢ ℕ0 ∈ V
4	3	mptex 5943	. . . . . 6 ⊢ (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))) ∈ V
5		vex 2824	. . . . . 6 ⊢ 𝑦 ∈ V
6	4, 5	fvex 5715	. . . . 5 ⊢ ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘𝑦) ∈ V
7	6	a1i 9	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘𝑦) ∈ V)
8		eqid 2238	. . . . . 6 ⊢ (𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)) = (𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))
9		vex 2824	. . . . . . 7 ⊢ ℎ ∈ V
10		vex 2824	. . . . . . 7 ⊢ 𝑥 ∈ V
11	9, 10	fvex 5715	. . . . . 6 ⊢ (ℎ‘𝑥) ∈ V
12		vex 2824	. . . . . 6 ⊢ 𝑧 ∈ V
13	8, 11, 5, 12	mpofvexi 6442	. . . . 5 ⊢ (𝑦(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))𝑧) ∈ V
14	13	a1i 9	. . . 4 ⊢ ((𝜑 ∧ (𝑦 ∈ V ∧ 𝑧 ∈ V)) → (𝑦(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))𝑧) ∈ V)
15	1, 2, 7, 14	seqf 10903	. . 3 ⊢ (𝜑 → seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))):ℕ0⟶V)
16		depindlem1.4	. . . 4 ⊢ 𝐹 = seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))
17	16	feq1i 5526	. . 3 ⊢ (𝐹:ℕ0⟶V ↔ seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))):ℕ0⟶V)
18	15, 17	sylibr 134	. 2 ⊢ (𝜑 → 𝐹:ℕ0⟶V)
19	16	fveq1i 5696	. . . 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 10901	. . . 4 ⊢ (𝜑 → (seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘0) = ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘0))
22	19, 21	eqtrid 2283	. . 3 ⊢ (𝜑 → (𝐹‘0) = ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘0))
23		0nn0 9580	. . . 4 ⊢ 0 ∈ ℕ0
24		depind.0	. . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝑃‘0))
25		iftrue 3645	. . . . 5 ⊢ (𝑚 = 0 → if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))) = 𝐴)
26		eqid 2238	. . . . 5 ⊢ (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))) = (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))
27	25, 26	fvmptg 5781	. . . 4 ⊢ ((0 ∈ ℕ0 ∧ 𝐴 ∈ (𝑃‘0)) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘0) = 𝐴)
28	23, 24, 27	sylancr 418	. . 3 ⊢ (𝜑 → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘0) = 𝐴)
29	22, 28	eqtrd 2271	. 2 ⊢ (𝜑 → (𝐹‘0) = 𝐴)
30		simpr 110	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0)
31	30, 1	eleqtrdi 2331	. . . . . . . 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 10904	. . . . . . 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 5696	. . . . . . 7 ⊢ (𝐹‘(𝑘 + 1)) = (seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘(𝑘 + 1))
36	16	fveq1i 5696	. . . . . . . 8 ⊢ (𝐹‘𝑘) = (seq0((𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)), (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1)))))‘𝑘)
37	36	oveq1i 6095	. . . . . . 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 2296	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘(𝑘 + 1)) = ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1))))
39		eqeq1 2245	. . . . . . . . . 10 ⊢ (𝑚 = (𝑘 + 1) → (𝑚 = 0 ↔ (𝑘 + 1) = 0))
40		fvoveq1 6108	. . . . . . . . . 10 ⊢ (𝑚 = (𝑘 + 1) → (𝐻‘(𝑚 − 1)) = (𝐻‘((𝑘 + 1) − 1)))
41	39, 40	ifbieq2d 3665	. . . . . . . . 9 ⊢ (𝑚 = (𝑘 + 1) → if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))) = if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))))
42		nn0p1nn 9604	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ)
43	42	adantl 277	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℕ)
44	43	nnnn0d 9622	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℕ0)
45	43	nnne0d 9350	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝑘 + 1) ≠ 0)
46	45	neneqd 2441	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ¬ (𝑘 + 1) = 0)
47	46	iffalsed 3650	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))) = (𝐻‘((𝑘 + 1) − 1)))
48	30	nn0cnd 9624	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℂ)
49		pncan1 8704	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℂ → ((𝑘 + 1) − 1) = 𝑘)
50	48, 49	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑘 + 1) − 1) = 𝑘)
51	50	fveq2d 5699	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘((𝑘 + 1) − 1)) = (𝐻‘𝑘))
52	47, 51	eqtrd 2271	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))) = (𝐻‘𝑘))
53		depind.h	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 (𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)))
54		fveq2 5695	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝐻‘𝑛) = (𝐻‘𝑘))
55		fveq2 5695	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝑃‘𝑛) = (𝑃‘𝑘))
56		fvoveq1 6108	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝑃‘(𝑛 + 1)) = (𝑃‘(𝑘 + 1)))
57	54, 55, 56	feq123d 5524	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)) ↔ (𝐻‘𝑘):(𝑃‘𝑘)⟶(𝑃‘(𝑘 + 1))))
58	57	rspccva 2928	. . . . . . . . . . . 12 ⊢ ((∀𝑛 ∈ ℕ0 (𝐻‘𝑛):(𝑃‘𝑛)⟶(𝑃‘(𝑛 + 1)) ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘):(𝑃‘𝑘)⟶(𝑃‘(𝑘 + 1)))
59	53, 58	sylan 283	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘):(𝑃‘𝑘)⟶(𝑃‘(𝑘 + 1)))
60		depind.p	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃:ℕ0⟶V)
61	60	ffvelcdmda 5843	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝑃‘𝑘) ∈ V)
62	59, 61	fexd 5948	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐻‘𝑘) ∈ V)
63	52, 62	eqeltrd 2315	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))) ∈ V)
64	26, 41, 44, 63	fvmptd3 5799	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1)) = if((𝑘 + 1) = 0, 𝐴, (𝐻‘((𝑘 + 1) − 1))))
65	64, 52	eqtrd 2271	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1)) = (𝐻‘𝑘))
66	65	oveq2d 6101	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐴, (𝐻‘(𝑚 − 1))))‘(𝑘 + 1))) = ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))(𝐻‘𝑘)))
67	38, 66	eqtrd 2271	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘(𝑘 + 1)) = ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))(𝐻‘𝑘)))
68	18	ffvelcdmda 5843	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ V)
69		fvexg 5714	. . . . . . 7 ⊢ (((𝐻‘𝑘) ∈ V ∧ (𝐹‘𝑘) ∈ V) → ((𝐻‘𝑘)‘(𝐹‘𝑘)) ∈ V)
70	62, 68, 69	syl2anc 415	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐻‘𝑘)‘(𝐹‘𝑘)) ∈ V)
71		fveq2 5695	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝑘) → (𝑧‘𝑦) = (𝑧‘(𝐹‘𝑘)))
72		fveq1 5694	. . . . . . 7 ⊢ (𝑧 = (𝐻‘𝑘) → (𝑧‘(𝐹‘𝑘)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
73		fveq2 5695	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (ℎ‘𝑥) = (ℎ‘𝑦))
74		fveq1 5694	. . . . . . . 8 ⊢ (ℎ = 𝑧 → (ℎ‘𝑦) = (𝑧‘𝑦))
75	73, 74	cbvmpov 6168	. . . . . . 7 ⊢ (𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥)) = (𝑦 ∈ V, 𝑧 ∈ V ↦ (𝑧‘𝑦))
76	71, 72, 75	ovmpog 6223	. . . . . 6 ⊢ (((𝐹‘𝑘) ∈ V ∧ (𝐻‘𝑘) ∈ V ∧ ((𝐻‘𝑘)‘(𝐹‘𝑘)) ∈ V) → ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))(𝐻‘𝑘)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
77	68, 62, 70, 76	syl3anc 1278	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐹‘𝑘)(𝑥 ∈ V, ℎ ∈ V ↦ (ℎ‘𝑥))(𝐻‘𝑘)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
78	67, 77	eqtrd 2271	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
79	78	ralrimiva 2623	. . 3 ⊢ (𝜑 → ∀𝑘 ∈ ℕ0 (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
80		fvoveq1 6108	. . . . 5 ⊢ (𝑛 = 𝑘 → (𝐹‘(𝑛 + 1)) = (𝐹‘(𝑘 + 1)))
81		fveq2 5695	. . . . . 6 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
82	54, 81	fveq12d 5702	. . . . 5 ⊢ (𝑛 = 𝑘 → ((𝐻‘𝑛)‘(𝐹‘𝑛)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
83	80, 82	eqeq12d 2253	. . . 4 ⊢ (𝑛 = 𝑘 → ((𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛)) ↔ (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘))))
84	83	cbvralvw 2790	. . 3 ⊢ (∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛)) ↔ ∀𝑘 ∈ ℕ0 (𝐹‘(𝑘 + 1)) = ((𝐻‘𝑘)‘(𝐹‘𝑘)))
85	79, 84	sylibr 134	. 2 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛)))
86	18, 29, 85	3jca 1208	1 ⊢ (𝜑 → (𝐹:ℕ0⟶V ∧ (𝐹‘0) = 𝐴 ∧ ∀𝑛 ∈ ℕ0 (𝐹‘(𝑛 + 1)) = ((𝐻‘𝑛)‘(𝐹‘𝑛))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821  ifcif 3638   ↦ cmpt 4192  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085   ∈ cmpo 6087  ℂcc 8177  0cc0 8179  1c1 8180   + caddc 8182   − cmin 8497  ℕcn 9305  ℕ₀cn0 9565  ℤ_≥cuz 9923  seqcseq 10886

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9306  df-n0 9566  df-z 9647  df-uz 9924  df-seqfrec 10887

This theorem is used by:  depindlem2  16760  depindlem3  16761  depind  16762