Theorem dfac12lem1 10097

Description: Lemma for dfac12 10103. (Contributed by Mario Carneiro, 29-May-2015.)

Hypotheses

Ref	Expression
dfac12.1	⊢ (𝜑 → 𝐴 ∈ On)
dfac12.3	⊢ (𝜑 → 𝐹:𝒫 (har‘(𝑅1‘𝐴))–1-1→On)
dfac12.4	⊢ 𝐺 = recs((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦))))))
dfac12.5	⊢ (𝜑 → 𝐶 ∈ On)
dfac12.h	⊢ 𝐻 = (◡OrdIso( E , ran (𝐺‘∪ 𝐶)) ∘ (𝐺‘∪ 𝐶))

Assertion

Ref	Expression
dfac12lem1	⊢ (𝜑 → (𝐺‘𝐶) = (𝑦 ∈ (𝑅1‘𝐶) ↦ if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻 “ 𝑦)))))

Distinct variable groups:   𝑦,𝐴   𝑥,𝑦,𝐶   𝑥,𝐺,𝑦   𝜑,𝑦   𝑥,𝐹,𝑦   𝑦,𝐻

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)   𝐻(𝑥)

Proof of Theorem dfac12lem1

Step	Hyp	Ref	Expression
1		dfac12.5	. . 3 ⊢ (𝜑 → 𝐶 ∈ On)
2		dfac12.4	. . . 4 ⊢ 𝐺 = recs((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦))))))
3	2	tfr2 8366	. . 3 ⊢ (𝐶 ∈ On → (𝐺‘𝐶) = ((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦)))))‘(𝐺 ↾ 𝐶)))
4	1, 3	syl 17	. 2 ⊢ (𝜑 → (𝐺‘𝐶) = ((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦)))))‘(𝐺 ↾ 𝐶)))
5	2	tfr1 8365	. . . . 5 ⊢ 𝐺 Fn On
6		fnfun 6618	. . . . 5 ⊢ (𝐺 Fn On → Fun 𝐺)
7	5, 6	ax-mp 5	. . . 4 ⊢ Fun 𝐺
8		resfunexg 7189	. . . 4 ⊢ ((Fun 𝐺 ∧ 𝐶 ∈ On) → (𝐺 ↾ 𝐶) ∈ V)
9	7, 1, 8	sylancr 587	. . 3 ⊢ (𝜑 → (𝐺 ↾ 𝐶) ∈ V)
10		dmeq 5867	. . . . . 6 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → dom 𝑥 = dom (𝐺 ↾ 𝐶))
11	10	fveq2d 6862	. . . . 5 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (𝑅1‘dom 𝑥) = (𝑅1‘dom (𝐺 ↾ 𝐶)))
12	10	unieqd 4884	. . . . . . 7 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ∪ dom 𝑥 = ∪ dom (𝐺 ↾ 𝐶))
13	10, 12	eqeq12d 2745	. . . . . 6 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (dom 𝑥 = ∪ dom 𝑥 ↔ dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶)))
14		rneq 5900	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ran 𝑥 = ran (𝐺 ↾ 𝐶))
15		df-ima 5651	. . . . . . . . . . . . 13 ⊢ (𝐺 “ 𝐶) = ran (𝐺 ↾ 𝐶)
16	14, 15	eqtr4di 2782	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ran 𝑥 = (𝐺 “ 𝐶))
17	16	unieqd 4884	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ∪ ran 𝑥 = ∪ (𝐺 “ 𝐶))
18	17	rneqd 5902	. . . . . . . . . 10 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ran ∪ ran 𝑥 = ran ∪ (𝐺 “ 𝐶))
19	18	unieqd 4884	. . . . . . . . 9 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ∪ ran ∪ ran 𝑥 = ∪ ran ∪ (𝐺 “ 𝐶))
20		suceq 6400	. . . . . . . . 9 ⊢ (∪ ran ∪ ran 𝑥 = ∪ ran ∪ (𝐺 “ 𝐶) → suc ∪ ran ∪ ran 𝑥 = suc ∪ ran ∪ (𝐺 “ 𝐶))
21	19, 20	syl 17	. . . . . . . 8 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → suc ∪ ran ∪ ran 𝑥 = suc ∪ ran ∪ (𝐺 “ 𝐶))
22	21	oveq1d 7402	. . . . . . 7 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) = (suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)))
23		fveq1 6857	. . . . . . . 8 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (𝑥‘suc (rank‘𝑦)) = ((𝐺 ↾ 𝐶)‘suc (rank‘𝑦)))
24	23	fveq1d 6860	. . . . . . 7 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ((𝑥‘suc (rank‘𝑦))‘𝑦) = (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦))
25	22, 24	oveq12d 7405	. . . . . 6 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)) = ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)))
26		id 22	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → 𝑥 = (𝐺 ↾ 𝐶))
27	26, 12	fveq12d 6865	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (𝑥‘∪ dom 𝑥) = ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)))
28	27	rneqd 5902	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ran (𝑥‘∪ dom 𝑥) = ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)))
29		oieq2 9466	. . . . . . . . . . 11 ⊢ (ran (𝑥‘∪ dom 𝑥) = ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)) → OrdIso( E , ran (𝑥‘∪ dom 𝑥)) = OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))))
30	28, 29	syl 17	. . . . . . . . . 10 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → OrdIso( E , ran (𝑥‘∪ dom 𝑥)) = OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))))
31	30	cnveqd 5839	. . . . . . . . 9 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) = ◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))))
32	31, 27	coeq12d 5828	. . . . . . . 8 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) = (◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))))
33	32	imaeq1d 6030	. . . . . . 7 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦) = ((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦))
34	33	fveq2d 6862	. . . . . 6 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦)) = (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))
35	13, 25, 34	ifbieq12d 4517	. . . . 5 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦))) = if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦))))
36	11, 35	mpteq12dv 5194	. . . 4 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦)))) = (𝑦 ∈ (𝑅1‘dom (𝐺 ↾ 𝐶)) ↦ if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))))
37		eqid 2729	. . . 4 ⊢ (𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦))))) = (𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦)))))
38		fvex 6871	. . . . 5 ⊢ (𝑅1‘dom (𝐺 ↾ 𝐶)) ∈ V
39	38	mptex 7197	. . . 4 ⊢ (𝑦 ∈ (𝑅1‘dom (𝐺 ↾ 𝐶)) ↦ if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))) ∈ V
40	36, 37, 39	fvmpt 6968	. . 3 ⊢ ((𝐺 ↾ 𝐶) ∈ V → ((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦)))))‘(𝐺 ↾ 𝐶)) = (𝑦 ∈ (𝑅1‘dom (𝐺 ↾ 𝐶)) ↦ if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))))
41	9, 40	syl 17	. 2 ⊢ (𝜑 → ((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦)))))‘(𝐺 ↾ 𝐶)) = (𝑦 ∈ (𝑅1‘dom (𝐺 ↾ 𝐶)) ↦ if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))))
42		onss 7761	. . . . . . . 8 ⊢ (𝐶 ∈ On → 𝐶 ⊆ On)
43	1, 42	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐶 ⊆ On)
44		fnssres 6641	. . . . . . 7 ⊢ ((𝐺 Fn On ∧ 𝐶 ⊆ On) → (𝐺 ↾ 𝐶) Fn 𝐶)
45	5, 43, 44	sylancr 587	. . . . . 6 ⊢ (𝜑 → (𝐺 ↾ 𝐶) Fn 𝐶)
46	45	fndmd 6623	. . . . 5 ⊢ (𝜑 → dom (𝐺 ↾ 𝐶) = 𝐶)
47	46	fveq2d 6862	. . . 4 ⊢ (𝜑 → (𝑅1‘dom (𝐺 ↾ 𝐶)) = (𝑅1‘𝐶))
48	47	mpteq1d 5197	. . 3 ⊢ (𝜑 → (𝑦 ∈ (𝑅1‘dom (𝐺 ↾ 𝐶)) ↦ if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))) = (𝑦 ∈ (𝑅1‘𝐶) ↦ if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))))
49	46	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → dom (𝐺 ↾ 𝐶) = 𝐶)
50	49	unieqd 4884	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → ∪ dom (𝐺 ↾ 𝐶) = ∪ 𝐶)
51	49, 50	eqeq12d 2745	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → (dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶) ↔ 𝐶 = ∪ 𝐶))
52	51	ifbid 4512	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦))) = if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦))))
53		rankr1ai 9751	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝑅1‘𝐶) → (rank‘𝑦) ∈ 𝐶)
54	53	ad2antlr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → (rank‘𝑦) ∈ 𝐶)
55		simpr 484	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → 𝐶 = ∪ 𝐶)
56	54, 55	eleqtrd 2830	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → (rank‘𝑦) ∈ ∪ 𝐶)
57		eloni 6342	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ On → Ord 𝐶)
58		ordsucuniel 7799	. . . . . . . . . . . 12 ⊢ (Ord 𝐶 → ((rank‘𝑦) ∈ ∪ 𝐶 ↔ suc (rank‘𝑦) ∈ 𝐶))
59	1, 57, 58	3syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → ((rank‘𝑦) ∈ ∪ 𝐶 ↔ suc (rank‘𝑦) ∈ 𝐶))
60	59	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → ((rank‘𝑦) ∈ ∪ 𝐶 ↔ suc (rank‘𝑦) ∈ 𝐶))
61	56, 60	mpbid 232	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → suc (rank‘𝑦) ∈ 𝐶)
62	61	fvresd 6878	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → ((𝐺 ↾ 𝐶)‘suc (rank‘𝑦)) = (𝐺‘suc (rank‘𝑦)))
63	62	fveq1d 6860	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦) = ((𝐺‘suc (rank‘𝑦))‘𝑦))
64	63	oveq2d 7403	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)) = ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)))
65	64	ifeq1da 4520	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦))) = if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦))))
66	50	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ∪ dom (𝐺 ↾ 𝐶) = ∪ 𝐶)
67	66	fveq2d 6862	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)) = ((𝐺 ↾ 𝐶)‘∪ 𝐶))
68	1	ad2antrr 726	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → 𝐶 ∈ On)
69		uniexg 7716	. . . . . . . . . . . . . . . . 17 ⊢ (𝐶 ∈ On → ∪ 𝐶 ∈ V)
70		sucidg 6415	. . . . . . . . . . . . . . . . 17 ⊢ (∪ 𝐶 ∈ V → ∪ 𝐶 ∈ suc ∪ 𝐶)
71	68, 69, 70	3syl 18	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ∪ 𝐶 ∈ suc ∪ 𝐶)
72	1	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → 𝐶 ∈ On)
73		orduniorsuc 7805	. . . . . . . . . . . . . . . . . 18 ⊢ (Ord 𝐶 → (𝐶 = ∪ 𝐶 ∨ 𝐶 = suc ∪ 𝐶))
74	72, 57, 73	3syl 18	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → (𝐶 = ∪ 𝐶 ∨ 𝐶 = suc ∪ 𝐶))
75	74	orcanai 1004	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → 𝐶 = suc ∪ 𝐶)
76	71, 75	eleqtrrd 2831	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ∪ 𝐶 ∈ 𝐶)
77	76	fvresd 6878	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ((𝐺 ↾ 𝐶)‘∪ 𝐶) = (𝐺‘∪ 𝐶))
78	67, 77	eqtrd 2764	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)) = (𝐺‘∪ 𝐶))
79	78	rneqd 5902	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)) = ran (𝐺‘∪ 𝐶))
80		oieq2 9466	. . . . . . . . . . . 12 ⊢ (ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)) = ran (𝐺‘∪ 𝐶) → OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) = OrdIso( E , ran (𝐺‘∪ 𝐶)))
81	79, 80	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) = OrdIso( E , ran (𝐺‘∪ 𝐶)))
82	81	cnveqd 5839	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) = ◡OrdIso( E , ran (𝐺‘∪ 𝐶)))
83	82, 78	coeq12d 5828	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → (◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) = (◡OrdIso( E , ran (𝐺‘∪ 𝐶)) ∘ (𝐺‘∪ 𝐶)))
84		dfac12.h	. . . . . . . . 9 ⊢ 𝐻 = (◡OrdIso( E , ran (𝐺‘∪ 𝐶)) ∘ (𝐺‘∪ 𝐶))
85	83, 84	eqtr4di 2782	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → (◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) = 𝐻)
86	85	imaeq1d 6030	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦) = (𝐻 “ 𝑦))
87	86	fveq2d 6862	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)) = (𝐹‘(𝐻 “ 𝑦)))
88	87	ifeq2da 4521	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦))) = if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻 “ 𝑦))))
89	52, 65, 88	3eqtrd 2768	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦))) = if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻 “ 𝑦))))
90	89	mpteq2dva 5200	. . 3 ⊢ (𝜑 → (𝑦 ∈ (𝑅1‘𝐶) ↦ if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))) = (𝑦 ∈ (𝑅1‘𝐶) ↦ if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻 “ 𝑦)))))
91	48, 90	eqtrd 2764	. 2 ⊢ (𝜑 → (𝑦 ∈ (𝑅1‘dom (𝐺 ↾ 𝐶)) ↦ if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))) = (𝑦 ∈ (𝑅1‘𝐶) ↦ if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻 “ 𝑦)))))
92	4, 41, 91	3eqtrd 2768	1 ⊢ (𝜑 → (𝐺‘𝐶) = (𝑦 ∈ (𝑅1‘𝐶) ↦ if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻 “ 𝑦)))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109  Vcvv 3447   ⊆ wss 3914  ifcif 4488  𝒫 cpw 4563  ∪ cuni 4871   ↦ cmpt 5188   E cep 5537  ^◡ccnv 5637  dom cdm 5638  ran crn 5639   ↾ cres 5640   “ cima 5641   ∘ ccom 5642  Ord word 6331  Oncon0 6332  suc csuc 6334  Fun wfun 6505   Fn wfn 6506  –1-1→wf1 6508  ‘cfv 6511  (class class class)co 7387  recscrecs 8339   +_o coa 8431   ·_o comu 8432  OrdIsocoi 9462  harchar 9509  𝑅₁cr1 9715  rankcrnk 9716

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-om 7843  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-oi 9463  df-r1 9717  df-rank 9718

This theorem is referenced by:  dfac12lem2  10098