Theorem rdgeqoa 36240

Description: If a recursive function with an initial value 𝐴 at step 𝑁 is equal to itself with an initial value 𝐵 at step 𝑀, then every finite number of successor steps will also be equal. (Contributed by ML, 21-Oct-2020.)

Assertion

Ref	Expression
rdgeqoa	⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑋 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑋)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑋))))

Proof of Theorem rdgeqoa

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp3 1139	. 2 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑋 ∈ ω) → 𝑋 ∈ ω)
2		eleq1 2822	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ ω ↔ 𝑋 ∈ ω))
3	2	3anbi3d 1443	. . . 4 ⊢ (𝑥 = 𝑋 → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ↔ (𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑋 ∈ ω)))
4		oveq2 7414	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑁 +o 𝑥) = (𝑁 +o 𝑋))
5	4	fveq2d 6893	. . . . . 6 ⊢ (𝑥 = 𝑋 → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐴)‘(𝑁 +o 𝑋)))
6		oveq2 7414	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑀 +o 𝑥) = (𝑀 +o 𝑋))
7	6	fveq2d 6893	. . . . . 6 ⊢ (𝑥 = 𝑋 → (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑋)))
8	5, 7	eqeq12d 2749	. . . . 5 ⊢ (𝑥 = 𝑋 → ((rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ↔ (rec(𝐹, 𝐴)‘(𝑁 +o 𝑋)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑋))))
9	8	imbi2d 341	. . . 4 ⊢ (𝑥 = 𝑋 → (((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) ↔ ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑋)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑋)))))
10	3, 9	imbi12d 345	. . 3 ⊢ (𝑥 = 𝑋 → (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) ↔ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑋 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑋)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑋))))))
11		peano1 7876	. . . . 5 ⊢ ∅ ∈ ω
12		oa0 8513	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ On → (𝑁 +o ∅) = 𝑁)
13	12	fveq2d 6893	. . . . . . . . . . 11 ⊢ (𝑁 ∈ On → (rec(𝐹, 𝐴)‘(𝑁 +o ∅)) = (rec(𝐹, 𝐴)‘𝑁))
14	13	eqcomd 2739	. . . . . . . . . 10 ⊢ (𝑁 ∈ On → (rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐴)‘(𝑁 +o ∅)))
15		oa0 8513	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ On → (𝑀 +o ∅) = 𝑀)
16	15	fveq2d 6893	. . . . . . . . . . 11 ⊢ (𝑀 ∈ On → (rec(𝐹, 𝐵)‘(𝑀 +o ∅)) = (rec(𝐹, 𝐵)‘𝑀))
17	16	eqcomd 2739	. . . . . . . . . 10 ⊢ (𝑀 ∈ On → (rec(𝐹, 𝐵)‘𝑀) = (rec(𝐹, 𝐵)‘(𝑀 +o ∅)))
18	14, 17	eqeqan12d 2747	. . . . . . . . 9 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) ↔ (rec(𝐹, 𝐴)‘(𝑁 +o ∅)) = (rec(𝐹, 𝐵)‘(𝑀 +o ∅))))
19	18	biimpd 228	. . . . . . . 8 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o ∅)) = (rec(𝐹, 𝐵)‘(𝑀 +o ∅))))
20		eleq1 2822	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (𝑥 ∈ ω ↔ ∅ ∈ ω))
21	20	3anbi3d 1443	. . . . . . . . . 10 ⊢ (𝑥 = ∅ → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ↔ (𝑁 ∈ On ∧ 𝑀 ∈ On ∧ ∅ ∈ ω)))
22	11	biantru 531	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ On ↔ (𝑀 ∈ On ∧ ∅ ∈ ω))
23	22	anbi2i 624	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On) ↔ (𝑁 ∈ On ∧ (𝑀 ∈ On ∧ ∅ ∈ ω)))
24		3anass 1096	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ ∅ ∈ ω) ↔ (𝑁 ∈ On ∧ (𝑀 ∈ On ∧ ∅ ∈ ω)))
25	23, 24	bitr4i 278	. . . . . . . . . 10 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On) ↔ (𝑁 ∈ On ∧ 𝑀 ∈ On ∧ ∅ ∈ ω))
26	21, 25	bitr4di 289	. . . . . . . . 9 ⊢ (𝑥 = ∅ → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ↔ (𝑁 ∈ On ∧ 𝑀 ∈ On)))
27		oveq2 7414	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → (𝑁 +o 𝑥) = (𝑁 +o ∅))
28	27	fveq2d 6893	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐴)‘(𝑁 +o ∅)))
29		oveq2 7414	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → (𝑀 +o 𝑥) = (𝑀 +o ∅))
30	29	fveq2d 6893	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o ∅)))
31	28, 30	eqeq12d 2749	. . . . . . . . . 10 ⊢ (𝑥 = ∅ → ((rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ↔ (rec(𝐹, 𝐴)‘(𝑁 +o ∅)) = (rec(𝐹, 𝐵)‘(𝑀 +o ∅))))
32	31	imbi2d 341	. . . . . . . . 9 ⊢ (𝑥 = ∅ → (((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) ↔ ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o ∅)) = (rec(𝐹, 𝐵)‘(𝑀 +o ∅)))))
33	26, 32	imbi12d 345	. . . . . . . 8 ⊢ (𝑥 = ∅ → (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) ↔ ((𝑁 ∈ On ∧ 𝑀 ∈ On) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o ∅)) = (rec(𝐹, 𝐵)‘(𝑀 +o ∅))))))
34	19, 33	mpbiri 258	. . . . . . 7 ⊢ (𝑥 = ∅ → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))))
35	34	ax-gen 1798	. . . . . 6 ⊢ ∀𝑥(𝑥 = ∅ → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))))
36		sbc6g 3807	. . . . . 6 ⊢ (∅ ∈ ω → ([∅ / 𝑥]((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) ↔ ∀𝑥(𝑥 = ∅ → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))))))
37	35, 36	mpbiri 258	. . . . 5 ⊢ (∅ ∈ ω → [∅ / 𝑥]((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))))
38	11, 37	ax-mp 5	. . . 4 ⊢ [∅ / 𝑥]((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))
39		peano2b 7869	. . . . 5 ⊢ (𝑥 ∈ ω ↔ suc 𝑥 ∈ ω)
40	39	3anbi3i 1160	. . . . . . . 8 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ↔ (𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω))
41	40	imbi1i 350	. . . . . . 7 ⊢ (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) ↔ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))))
42		nnon 7858	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ω → 𝑥 ∈ On)
43		oacl 8532	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ On ∧ 𝑥 ∈ On) → (𝑁 +o 𝑥) ∈ On)
44		oacl 8532	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 ∈ On ∧ 𝑥 ∈ On) → (𝑀 +o 𝑥) ∈ On)
45	43, 44	anim12i 614	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 ∈ On ∧ 𝑥 ∈ On) ∧ (𝑀 ∈ On ∧ 𝑥 ∈ On)) → ((𝑁 +o 𝑥) ∈ On ∧ (𝑀 +o 𝑥) ∈ On))
46	45	3impdir 1352	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ On) → ((𝑁 +o 𝑥) ∈ On ∧ (𝑀 +o 𝑥) ∈ On))
47		rdgsuc 8421	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 +o 𝑥) ∈ On → (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)) = (𝐹‘(rec(𝐹, 𝐴)‘(𝑁 +o 𝑥))))
48		fveq2 6889	. . . . . . . . . . . . . . . . . 18 ⊢ ((rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) → (𝐹‘(rec(𝐹, 𝐴)‘(𝑁 +o 𝑥))) = (𝐹‘(rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))
49	47, 48	sylan9eqr 2795	. . . . . . . . . . . . . . . . 17 ⊢ (((rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ∧ (𝑁 +o 𝑥) ∈ On) → (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)) = (𝐹‘(rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))
50	49	adantrr 716	. . . . . . . . . . . . . . . 16 ⊢ (((rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ∧ ((𝑁 +o 𝑥) ∈ On ∧ (𝑀 +o 𝑥) ∈ On)) → (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)) = (𝐹‘(rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))
51		rdgsuc 8421	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀 +o 𝑥) ∈ On → (rec(𝐹, 𝐵)‘suc (𝑀 +o 𝑥)) = (𝐹‘(rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))
52	51	ad2antll 728	. . . . . . . . . . . . . . . 16 ⊢ (((rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ∧ ((𝑁 +o 𝑥) ∈ On ∧ (𝑀 +o 𝑥) ∈ On)) → (rec(𝐹, 𝐵)‘suc (𝑀 +o 𝑥)) = (𝐹‘(rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))
53	50, 52	eqtr4d 2776	. . . . . . . . . . . . . . 15 ⊢ (((rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ∧ ((𝑁 +o 𝑥) ∈ On ∧ (𝑀 +o 𝑥) ∈ On)) → (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘suc (𝑀 +o 𝑥)))
54	46, 53	sylan2 594	. . . . . . . . . . . . . 14 ⊢ (((rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ∧ (𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ On)) → (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘suc (𝑀 +o 𝑥)))
55	54	ancoms 460	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ On) ∧ (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) → (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘suc (𝑀 +o 𝑥)))
56	42, 55	syl3anl3 1415	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ∧ (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) → (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘suc (𝑀 +o 𝑥)))
57		onasuc 8525	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ On ∧ 𝑥 ∈ ω) → (𝑁 +o suc 𝑥) = suc (𝑁 +o 𝑥))
58	57	fveq2d 6893	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ On ∧ 𝑥 ∈ ω) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)))
59	58	3adant2 1132	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)))
60	59	adantr 482	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ∧ (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐴)‘suc (𝑁 +o 𝑥)))
61		onasuc 8525	. . . . . . . . . . . . . . 15 ⊢ ((𝑀 ∈ On ∧ 𝑥 ∈ ω) → (𝑀 +o suc 𝑥) = suc (𝑀 +o 𝑥))
62	61	fveq2d 6893	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ On ∧ 𝑥 ∈ ω) → (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘suc (𝑀 +o 𝑥)))
63	62	3adant1 1131	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘suc (𝑀 +o 𝑥)))
64	63	adantr 482	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ∧ (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) → (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘suc (𝑀 +o 𝑥)))
65	56, 60, 64	3eqtr4d 2783	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ∧ (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)))
66	65	ex 414	. . . . . . . . . 10 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥))))
67	66	imim2d 57	. . . . . . . . 9 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → (((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)))))
68	40, 67	sylbir 234	. . . . . . . 8 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω) → (((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)))))
69	68	a2i 14	. . . . . . 7 ⊢ (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)))))
70	41, 69	sylbi 216	. . . . . 6 ⊢ (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)))))
71		sbcimg 3828	. . . . . . 7 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥]((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) ↔ ([suc 𝑥 / 𝑥](𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → [suc 𝑥 / 𝑥]((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))))
72		sbc3an 3847	. . . . . . . . 9 ⊢ ([suc 𝑥 / 𝑥](𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ↔ ([suc 𝑥 / 𝑥]𝑁 ∈ On ∧ [suc 𝑥 / 𝑥]𝑀 ∈ On ∧ [suc 𝑥 / 𝑥]𝑥 ∈ ω))
73		sbcg 3856	. . . . . . . . . 10 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥]𝑁 ∈ On ↔ 𝑁 ∈ On))
74		sbcg 3856	. . . . . . . . . 10 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥]𝑀 ∈ On ↔ 𝑀 ∈ On))
75		sbcel1v 3848	. . . . . . . . . . 11 ⊢ ([suc 𝑥 / 𝑥]𝑥 ∈ ω ↔ suc 𝑥 ∈ ω)
76	75	a1i 11	. . . . . . . . . 10 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥]𝑥 ∈ ω ↔ suc 𝑥 ∈ ω))
77	73, 74, 76	3anbi123d 1437	. . . . . . . . 9 ⊢ (suc 𝑥 ∈ ω → (([suc 𝑥 / 𝑥]𝑁 ∈ On ∧ [suc 𝑥 / 𝑥]𝑀 ∈ On ∧ [suc 𝑥 / 𝑥]𝑥 ∈ ω) ↔ (𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω)))
78	72, 77	bitrid 283	. . . . . . . 8 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥](𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) ↔ (𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω)))
79		sbcimg 3828	. . . . . . . . 9 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥]((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) ↔ ([suc 𝑥 / 𝑥](rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → [suc 𝑥 / 𝑥](rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))))
80		sbcg 3856	. . . . . . . . . 10 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥](rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) ↔ (rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀)))
81		sbceqg 4409	. . . . . . . . . . 11 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥](rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ↔ ⦋suc 𝑥 / 𝑥⦌(rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = ⦋suc 𝑥 / 𝑥⦌(rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))
82		csbfv12 6937	. . . . . . . . . . . . 13 ⊢ ⦋suc 𝑥 / 𝑥⦌(rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (⦋suc 𝑥 / 𝑥⦌rec(𝐹, 𝐴)‘⦋suc 𝑥 / 𝑥⦌(𝑁 +o 𝑥))
83		csbconstg 3912	. . . . . . . . . . . . . 14 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌rec(𝐹, 𝐴) = rec(𝐹, 𝐴))
84		csbov123 7448	. . . . . . . . . . . . . . 15 ⊢ ⦋suc 𝑥 / 𝑥⦌(𝑁 +o 𝑥) = (⦋suc 𝑥 / 𝑥⦌𝑁⦋suc 𝑥 / 𝑥⦌ +o ⦋suc 𝑥 / 𝑥⦌𝑥)
85		csbconstg 3912	. . . . . . . . . . . . . . . 16 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌ +o = +o )
86		csbconstg 3912	. . . . . . . . . . . . . . . 16 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌𝑁 = 𝑁)
87		csbvarg 4431	. . . . . . . . . . . . . . . 16 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌𝑥 = suc 𝑥)
88	85, 86, 87	oveq123d 7427	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑥 ∈ ω → (⦋suc 𝑥 / 𝑥⦌𝑁⦋suc 𝑥 / 𝑥⦌ +o ⦋suc 𝑥 / 𝑥⦌𝑥) = (𝑁 +o suc 𝑥))
89	84, 88	eqtrid 2785	. . . . . . . . . . . . . 14 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌(𝑁 +o 𝑥) = (𝑁 +o suc 𝑥))
90	83, 89	fveq12d 6896	. . . . . . . . . . . . 13 ⊢ (suc 𝑥 ∈ ω → (⦋suc 𝑥 / 𝑥⦌rec(𝐹, 𝐴)‘⦋suc 𝑥 / 𝑥⦌(𝑁 +o 𝑥)) = (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)))
91	82, 90	eqtrid 2785	. . . . . . . . . . . 12 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌(rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)))
92		csbfv12 6937	. . . . . . . . . . . . 13 ⊢ ⦋suc 𝑥 / 𝑥⦌(rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) = (⦋suc 𝑥 / 𝑥⦌rec(𝐹, 𝐵)‘⦋suc 𝑥 / 𝑥⦌(𝑀 +o 𝑥))
93		csbconstg 3912	. . . . . . . . . . . . . 14 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌rec(𝐹, 𝐵) = rec(𝐹, 𝐵))
94		csbov123 7448	. . . . . . . . . . . . . . 15 ⊢ ⦋suc 𝑥 / 𝑥⦌(𝑀 +o 𝑥) = (⦋suc 𝑥 / 𝑥⦌𝑀⦋suc 𝑥 / 𝑥⦌ +o ⦋suc 𝑥 / 𝑥⦌𝑥)
95		csbconstg 3912	. . . . . . . . . . . . . . . 16 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌𝑀 = 𝑀)
96	85, 95, 87	oveq123d 7427	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑥 ∈ ω → (⦋suc 𝑥 / 𝑥⦌𝑀⦋suc 𝑥 / 𝑥⦌ +o ⦋suc 𝑥 / 𝑥⦌𝑥) = (𝑀 +o suc 𝑥))
97	94, 96	eqtrid 2785	. . . . . . . . . . . . . 14 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌(𝑀 +o 𝑥) = (𝑀 +o suc 𝑥))
98	93, 97	fveq12d 6896	. . . . . . . . . . . . 13 ⊢ (suc 𝑥 ∈ ω → (⦋suc 𝑥 / 𝑥⦌rec(𝐹, 𝐵)‘⦋suc 𝑥 / 𝑥⦌(𝑀 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)))
99	92, 98	eqtrid 2785	. . . . . . . . . . . 12 ⊢ (suc 𝑥 ∈ ω → ⦋suc 𝑥 / 𝑥⦌(rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)))
100	91, 99	eqeq12d 2749	. . . . . . . . . . 11 ⊢ (suc 𝑥 ∈ ω → (⦋suc 𝑥 / 𝑥⦌(rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = ⦋suc 𝑥 / 𝑥⦌(rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ↔ (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥))))
101	81, 100	bitrd 279	. . . . . . . . . 10 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥](rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)) ↔ (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥))))
102	80, 101	imbi12d 345	. . . . . . . . 9 ⊢ (suc 𝑥 ∈ ω → (([suc 𝑥 / 𝑥](rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → [suc 𝑥 / 𝑥](rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) ↔ ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)))))
103	79, 102	bitrd 279	. . . . . . . 8 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥]((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))) ↔ ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥)))))
104	78, 103	imbi12d 345	. . . . . . 7 ⊢ (suc 𝑥 ∈ ω → (([suc 𝑥 / 𝑥](𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → [suc 𝑥 / 𝑥]((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) ↔ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥))))))
105	71, 104	bitrd 279	. . . . . 6 ⊢ (suc 𝑥 ∈ ω → ([suc 𝑥 / 𝑥]((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) ↔ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ suc 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o suc 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o suc 𝑥))))))
106	70, 105	imbitrrid 245	. . . . 5 ⊢ (suc 𝑥 ∈ ω → (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) → [suc 𝑥 / 𝑥]((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))))
107	39, 106	sylbi 216	. . . 4 ⊢ (𝑥 ∈ ω → (((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))) → [suc 𝑥 / 𝑥]((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥))))))
108	38, 107	findes 7890	. . 3 ⊢ (𝑥 ∈ ω → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑥 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑥)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑥)))))
109	10, 108	vtoclga 3566	. 2 ⊢ (𝑋 ∈ ω → ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑋 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑋)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑋)))))
110	1, 109	mpcom 38	1 ⊢ ((𝑁 ∈ On ∧ 𝑀 ∈ On ∧ 𝑋 ∈ ω) → ((rec(𝐹, 𝐴)‘𝑁) = (rec(𝐹, 𝐵)‘𝑀) → (rec(𝐹, 𝐴)‘(𝑁 +o 𝑋)) = (rec(𝐹, 𝐵)‘(𝑀 +o 𝑋))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   ∧ w3a 1088  ∀wal 1540   = wceq 1542   ∈ wcel 2107  [wsbc 3777  ⦋csb 3893  ∅c0 4322  Oncon0 6362  suc csuc 6364  ‘cfv 6541  (class class class)co 7406  ωcom 7852  reccrdg 8406   +_o coa 8460

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7722

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6298  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6493  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7409  df-oprab 7410  df-mpo 7411  df-om 7853  df-2nd 7973  df-frecs 8263  df-wrecs 8294  df-recs 8368  df-rdg 8407  df-oadd 8467

This theorem is referenced by:  finxpreclem4  36264