Theorem bnj964 35439

Description: Technical lemma for bnj69 35506. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj964.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj964.3	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj964.5	⊢ (𝜓′ ↔ [𝑝 / 𝑛]𝜓)
bnj964.8	⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓′)
bnj964.12	⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
bnj964.13	⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
bnj964.96	⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ suc 𝑖 ∈ 𝑛)) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
bnj964.165	⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑛 = suc 𝑖)) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))

Assertion

Ref	Expression
bnj964	⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝜓″)

Distinct variable groups:   𝐴,𝑓,𝑖,𝑛   𝐷,𝑖   𝑖,𝐺   𝑅,𝑓,𝑖,𝑛   𝑖,𝑋   𝑓,𝑝,𝑖   𝑦,𝑓,𝑖,𝑛   𝑖,𝑚   𝜑,𝑖

Allowed substitution hints:   𝜑(𝑦, 𝑓, 𝑚, 𝑛, 𝑝)   𝜓(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜒(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐴(𝑦, 𝑚, 𝑝)   𝐶(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐷(𝑦, 𝑓, 𝑚, 𝑛, 𝑝)   𝑅(𝑦, 𝑚, 𝑝)   𝐺(𝑦, 𝑓, 𝑚, 𝑛, 𝑝)   𝑋(𝑦, 𝑓, 𝑚, 𝑛, 𝑝)   𝜓′(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓″(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)

Proof of Theorem bnj964

Step	Hyp	Ref	Expression
1		nfv 1947	. . . 4 ⊢ Ⅎ𝑖(𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)
2		bnj964.2	. . . . . . . 8 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3	2	bnj1095 35278	. . . . . . 7 ⊢ (𝜓 → ∀𝑖𝜓)
4		bnj964.3	. . . . . . 7 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
5	3, 4	bnj1096 35279	. . . . . 6 ⊢ (𝜒 → ∀𝑖𝜒)
6	5	nf5i 2183	. . . . 5 ⊢ Ⅎ𝑖𝜒
7		nfv 1947	. . . . 5 ⊢ Ⅎ𝑖 𝑛 = suc 𝑚
8		nfv 1947	. . . . 5 ⊢ Ⅎ𝑖 𝑝 = suc 𝑛
9	6, 7, 8	nf3an 1934	. . . 4 ⊢ Ⅎ𝑖(𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)
10	1, 9	nfan 1932	. . 3 ⊢ Ⅎ𝑖((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
11		bnj255 35202	. . . . 5 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)))
12		bnj645 35247	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → suc 𝑖 ∈ 𝑝)
13		simp3 1156	. . . . . . . 8 ⊢ ((𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) → 𝑝 = suc 𝑛)
14	13	bnj706 35251	. . . . . . 7 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → 𝑝 = suc 𝑛)
15		eleq2 2851	. . . . . . . . 9 ⊢ (𝑝 = suc 𝑛 → (suc 𝑖 ∈ 𝑝 ↔ suc 𝑖 ∈ suc 𝑛))
16	15	biimpac 484	. . . . . . . 8 ⊢ ((suc 𝑖 ∈ 𝑝 ∧ 𝑝 = suc 𝑛) → suc 𝑖 ∈ suc 𝑛)
17		elsuci 6431	. . . . . . . . 9 ⊢ (suc 𝑖 ∈ suc 𝑛 → (suc 𝑖 ∈ 𝑛 ∨ suc 𝑖 = 𝑛))
18		eqcom 2769	. . . . . . . . . 10 ⊢ (suc 𝑖 = 𝑛 ↔ 𝑛 = suc 𝑖)
19	18	orbi2i 926	. . . . . . . . 9 ⊢ ((suc 𝑖 ∈ 𝑛 ∨ suc 𝑖 = 𝑛) ↔ (suc 𝑖 ∈ 𝑛 ∨ 𝑛 = suc 𝑖))
20	17, 19	sylib 221	. . . . . . . 8 ⊢ (suc 𝑖 ∈ suc 𝑛 → (suc 𝑖 ∈ 𝑛 ∨ 𝑛 = suc 𝑖))
21	16, 20	syl 18	. . . . . . 7 ⊢ ((suc 𝑖 ∈ 𝑝 ∧ 𝑝 = suc 𝑛) → (suc 𝑖 ∈ 𝑛 ∨ 𝑛 = suc 𝑖))
22	12, 14, 21	syl2anc 596	. . . . . 6 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → (suc 𝑖 ∈ 𝑛 ∨ 𝑛 = suc 𝑖))
23		df-3an 1105	. . . . . . . . . . . . 13 ⊢ ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ suc 𝑖 ∈ 𝑛) ↔ ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ suc 𝑖 ∈ 𝑛))
24	23	3anbi3i 1177	. . . . . . . . . . . 12 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ suc 𝑖 ∈ 𝑛)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ suc 𝑖 ∈ 𝑛)))
25		bnj255 35202	. . . . . . . . . . . 12 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ suc 𝑖 ∈ 𝑛) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ suc 𝑖 ∈ 𝑛)))
26	24, 25	bitr4i 281	. . . . . . . . . . 11 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ suc 𝑖 ∈ 𝑛)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ suc 𝑖 ∈ 𝑛))
27		bnj345 35211	. . . . . . . . . . 11 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ suc 𝑖 ∈ 𝑛) ↔ (suc 𝑖 ∈ 𝑛 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)))
28		bnj252 35200	. . . . . . . . . . 11 ⊢ ((suc 𝑖 ∈ 𝑛 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) ↔ (suc 𝑖 ∈ 𝑛 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))))
29	26, 27, 28	3bitri 300	. . . . . . . . . 10 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ suc 𝑖 ∈ 𝑛)) ↔ (suc 𝑖 ∈ 𝑛 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))))
30	11	anbi2i 635	. . . . . . . . . 10 ⊢ ((suc 𝑖 ∈ 𝑛 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) ↔ (suc 𝑖 ∈ 𝑛 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))))
31	29, 30	bitr4i 281	. . . . . . . . 9 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ suc 𝑖 ∈ 𝑛)) ↔ (suc 𝑖 ∈ 𝑛 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)))
32		bnj964.96	. . . . . . . . 9 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ suc 𝑖 ∈ 𝑛)) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
33	31, 32	sylbir 238	. . . . . . . 8 ⊢ ((suc 𝑖 ∈ 𝑛 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
34	33	ex 418	. . . . . . 7 ⊢ (suc 𝑖 ∈ 𝑛 → (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
35		df-3an 1105	. . . . . . . . . . . . 13 ⊢ ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑛 = suc 𝑖) ↔ ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑛 = suc 𝑖))
36	35	3anbi3i 1177	. . . . . . . . . . . 12 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑛 = suc 𝑖)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑛 = suc 𝑖)))
37		bnj255 35202	. . . . . . . . . . . 12 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑛 = suc 𝑖) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑛 = suc 𝑖)))
38	36, 37	bitr4i 281	. . . . . . . . . . 11 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑛 = suc 𝑖)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑛 = suc 𝑖))
39		bnj345 35211	. . . . . . . . . . 11 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑛 = suc 𝑖) ↔ (𝑛 = suc 𝑖 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)))
40		bnj252 35200	. . . . . . . . . . 11 ⊢ ((𝑛 = suc 𝑖 ∧ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) ↔ (𝑛 = suc 𝑖 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))))
41	38, 39, 40	3bitri 300	. . . . . . . . . 10 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑛 = suc 𝑖)) ↔ (𝑛 = suc 𝑖 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))))
42	11	anbi2i 635	. . . . . . . . . 10 ⊢ ((𝑛 = suc 𝑖 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) ↔ (𝑛 = suc 𝑖 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))))
43	41, 42	bitr4i 281	. . . . . . . . 9 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑛 = suc 𝑖)) ↔ (𝑛 = suc 𝑖 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)))
44		bnj964.165	. . . . . . . . 9 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑛 = suc 𝑖)) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
45	43, 44	sylbir 238	. . . . . . . 8 ⊢ ((𝑛 = suc 𝑖 ∧ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
46	45	ex 418	. . . . . . 7 ⊢ (𝑛 = suc 𝑖 → (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
47	34, 46	jaoi 871	. . . . . 6 ⊢ ((suc 𝑖 ∈ 𝑛 ∨ 𝑛 = suc 𝑖) → (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
48	22, 47	mpcom 39	. . . . 5 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
49	11, 48	sylbir 238	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
50	49	3expia 1139	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
51	10, 50	alrimi 2251	. 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → ∀𝑖((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
52		bnj964.5	. . . . 5 ⊢ (𝜓′ ↔ [𝑝 / 𝑛]𝜓)
53		vex 3457	. . . . 5 ⊢ 𝑝 ∈ V
54	2, 52, 53	bnj539 35387	. . . 4 ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑝 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
55		bnj964.8	. . . 4 ⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓′)
56		bnj964.12	. . . 4 ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
57		bnj964.13	. . . 4 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
58	54, 55, 56, 57	bnj965 35438	. . 3 ⊢ (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑝 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
59	58	bnj115 35222	. 2 ⊢ (𝜓″ ↔ ∀𝑖((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
60	51, 59	sylibr 237	1 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝜓″)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∀wral 3078  [wsbc 3742   ∪ cun 3900  {csn 4587  ⟨cop 4593  ∪ ciun 4954  suc csuc 6363   Fn wfn 6532  ‘cfv 6537  ωcom 7865   ∧ w-bnj17 35183   predc-bnj14 35185   FrSe w-bnj15 35189

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-suc 6367  df-iota 6493  df-fv 6545  df-bnj17 35184

This theorem is used by:  bnj910  35444