Theorem dfac12lem1 10184

Description: Lemma for dfac12 10190. (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 8438	. . 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 8437	. . . . 5 ⊢ 𝐺 Fn On
6		fnfun 6668	. . . . 5 ⊢ (𝐺 Fn On → Fun 𝐺)
7	5, 6	ax-mp 5	. . . 4 ⊢ Fun 𝐺
8		resfunexg 7235	. . . 4 ⊢ ((Fun 𝐺 ∧ 𝐶 ∈ On) → (𝐺 ↾ 𝐶) ∈ V)
9	7, 1, 8	sylancr 587	. . 3 ⊢ (𝜑 → (𝐺 ↾ 𝐶) ∈ V)
10		dmeq 5914	. . . . . 6 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → dom 𝑥 = dom (𝐺 ↾ 𝐶))
11	10	fveq2d 6910	. . . . 5 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (𝑅1‘dom 𝑥) = (𝑅1‘dom (𝐺 ↾ 𝐶)))
12	10	unieqd 4920	. . . . . . 7 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ∪ dom 𝑥 = ∪ dom (𝐺 ↾ 𝐶))
13	10, 12	eqeq12d 2753	. . . . . 6 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (dom 𝑥 = ∪ dom 𝑥 ↔ dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶)))
14		rneq 5947	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ran 𝑥 = ran (𝐺 ↾ 𝐶))
15		df-ima 5698	. . . . . . . . . . . . 13 ⊢ (𝐺 “ 𝐶) = ran (𝐺 ↾ 𝐶)
16	14, 15	eqtr4di 2795	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ran 𝑥 = (𝐺 “ 𝐶))
17	16	unieqd 4920	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ∪ ran 𝑥 = ∪ (𝐺 “ 𝐶))
18	17	rneqd 5949	. . . . . . . . . 10 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ran ∪ ran 𝑥 = ran ∪ (𝐺 “ 𝐶))
19	18	unieqd 4920	. . . . . . . . 9 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ∪ ran ∪ ran 𝑥 = ∪ ran ∪ (𝐺 “ 𝐶))
20		suceq 6450	. . . . . . . . 9 ⊢ (∪ ran ∪ ran 𝑥 = ∪ ran ∪ (𝐺 “ 𝐶) → suc ∪ ran ∪ ran 𝑥 = suc ∪ ran ∪ (𝐺 “ 𝐶))
21	19, 20	syl 17	. . . . . . . 8 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → suc ∪ ran ∪ ran 𝑥 = suc ∪ ran ∪ (𝐺 “ 𝐶))
22	21	oveq1d 7446	. . . . . . 7 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) = (suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)))
23		fveq1 6905	. . . . . . . 8 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (𝑥‘suc (rank‘𝑦)) = ((𝐺 ↾ 𝐶)‘suc (rank‘𝑦)))
24	23	fveq1d 6908	. . . . . . 7 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ((𝑥‘suc (rank‘𝑦))‘𝑦) = (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦))
25	22, 24	oveq12d 7449	. . . . . 6 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ((suc ∪ ran ∪ ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)) = ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)))
26		id 22	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → 𝑥 = (𝐺 ↾ 𝐶))
27	26, 12	fveq12d 6913	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (𝑥‘∪ dom 𝑥) = ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)))
28	27	rneqd 5949	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ran (𝑥‘∪ dom 𝑥) = ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)))
29		oieq2 9553	. . . . . . . . . . 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 5886	. . . . . . . . 9 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) = ◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))))
32	31, 27	coeq12d 5875	. . . . . . . 8 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) = (◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))))
33	32	imaeq1d 6077	. . . . . . 7 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → ((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦) = ((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦))
34	33	fveq2d 6910	. . . . . 6 ⊢ (𝑥 = (𝐺 ↾ 𝐶) → (𝐹‘((◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦)) = (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))
35	13, 25, 34	ifbieq12d 4554	. . . . 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 5233	. . . 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 2737	. . . 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 6919	. . . . 5 ⊢ (𝑅1‘dom (𝐺 ↾ 𝐶)) ∈ V
39	38	mptex 7243	. . . 4 ⊢ (𝑦 ∈ (𝑅1‘dom (𝐺 ↾ 𝐶)) ↦ if(dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶), ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)))) ∈ V
40	36, 37, 39	fvmpt 7016	. . 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 7805	. . . . . . . 8 ⊢ (𝐶 ∈ On → 𝐶 ⊆ On)
43	1, 42	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐶 ⊆ On)
44		fnssres 6691	. . . . . . 7 ⊢ ((𝐺 Fn On ∧ 𝐶 ⊆ On) → (𝐺 ↾ 𝐶) Fn 𝐶)
45	5, 43, 44	sylancr 587	. . . . . 6 ⊢ (𝜑 → (𝐺 ↾ 𝐶) Fn 𝐶)
46	45	fndmd 6673	. . . . 5 ⊢ (𝜑 → dom (𝐺 ↾ 𝐶) = 𝐶)
47	46	fveq2d 6910	. . . 4 ⊢ (𝜑 → (𝑅1‘dom (𝐺 ↾ 𝐶)) = (𝑅1‘𝐶))
48	47	mpteq1d 5237	. . 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 4920	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → ∪ dom (𝐺 ↾ 𝐶) = ∪ 𝐶)
51	49, 50	eqeq12d 2753	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → (dom (𝐺 ↾ 𝐶) = ∪ dom (𝐺 ↾ 𝐶) ↔ 𝐶 = ∪ 𝐶))
52	51	ifbid 4549	. . . . 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 9838	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝑅1‘𝐶) → (rank‘𝑦) ∈ 𝐶)
54	53	ad2antlr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → (rank‘𝑦) ∈ 𝐶)
55		simpr 484	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → 𝐶 = ∪ 𝐶)
56	54, 55	eleqtrd 2843	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → (rank‘𝑦) ∈ ∪ 𝐶)
57		eloni 6394	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ On → Ord 𝐶)
58		ordsucuniel 7844	. . . . . . . . . . . 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 6926	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → ((𝐺 ↾ 𝐶)‘suc (rank‘𝑦)) = (𝐺‘suc (rank‘𝑦)))
63	62	fveq1d 6908	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦) = ((𝐺‘suc (rank‘𝑦))‘𝑦))
64	63	oveq2d 7447	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ 𝐶 = ∪ 𝐶) → ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o (((𝐺 ↾ 𝐶)‘suc (rank‘𝑦))‘𝑦)) = ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)))
65	64	ifeq1da 4557	. . . . 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 6910	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)) = ((𝐺 ↾ 𝐶)‘∪ 𝐶))
68	1	ad2antrr 726	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → 𝐶 ∈ On)
69		uniexg 7760	. . . . . . . . . . . . . . . . 17 ⊢ (𝐶 ∈ On → ∪ 𝐶 ∈ V)
70		sucidg 6465	. . . . . . . . . . . . . . . . 17 ⊢ (∪ 𝐶 ∈ V → ∪ 𝐶 ∈ suc ∪ 𝐶)
71	68, 69, 70	3syl 18	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ∪ 𝐶 ∈ suc ∪ 𝐶)
72	1	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → 𝐶 ∈ On)
73		orduniorsuc 7850	. . . . . . . . . . . . . . . . . 18 ⊢ (Ord 𝐶 → (𝐶 = ∪ 𝐶 ∨ 𝐶 = suc ∪ 𝐶))
74	72, 57, 73	3syl 18	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) → (𝐶 = ∪ 𝐶 ∨ 𝐶 = suc ∪ 𝐶))
75	74	orcanai 1005	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → 𝐶 = suc ∪ 𝐶)
76	71, 75	eleqtrrd 2844	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ∪ 𝐶 ∈ 𝐶)
77	76	fvresd 6926	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ((𝐺 ↾ 𝐶)‘∪ 𝐶) = (𝐺‘∪ 𝐶))
78	67, 77	eqtrd 2777	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)) = (𝐺‘∪ 𝐶))
79	78	rneqd 5949	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶)) = ran (𝐺‘∪ 𝐶))
80		oieq2 9553	. . . . . . . . . . . 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 5886	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) = ◡OrdIso( E , ran (𝐺‘∪ 𝐶)))
83	82, 78	coeq12d 5875	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → (◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) = (◡OrdIso( E , ran (𝐺‘∪ 𝐶)) ∘ (𝐺‘∪ 𝐶)))
84		dfac12.h	. . . . . . . . 9 ⊢ 𝐻 = (◡OrdIso( E , ran (𝐺‘∪ 𝐶)) ∘ (𝐺‘∪ 𝐶))
85	83, 84	eqtr4di 2795	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → (◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) = 𝐻)
86	85	imaeq1d 6077	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → ((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦) = (𝐻 “ 𝑦))
87	86	fveq2d 6910	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ (𝑅1‘𝐶)) ∧ ¬ 𝐶 = ∪ 𝐶) → (𝐹‘((◡OrdIso( E , ran ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) ∘ ((𝐺 ↾ 𝐶)‘∪ dom (𝐺 ↾ 𝐶))) “ 𝑦)) = (𝐹‘(𝐻 “ 𝑦)))
88	87	ifeq2da 4558	. . . . 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 2781	. . . 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 5242	. . 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 2777	. 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 2781	1 ⊢ (𝜑 → (𝐺‘𝐶) = (𝑦 ∈ (𝑅1‘𝐶) ↦ if(𝐶 = ∪ 𝐶, ((suc ∪ ran ∪ (𝐺 “ 𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻 “ 𝑦)))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   = wceq 1540   ∈ wcel 2108  Vcvv 3480   ⊆ wss 3951  ifcif 4525  𝒫 cpw 4600  ∪ cuni 4907   ↦ cmpt 5225   E cep 5583  ^◡ccnv 5684  dom cdm 5685  ran crn 5686   ↾ cres 5687   “ cima 5688   ∘ ccom 5689  Ord word 6383  Oncon0 6384  suc csuc 6386  Fun wfun 6555   Fn wfn 6556  –1-1→wf1 6558  ‘cfv 6561  (class class class)co 7431  recscrecs 8410   +_o coa 8503   ·_o comu 8504  OrdIsocoi 9549  harchar 9596  𝑅₁cr1 9802  rankcrnk 9803

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-se 5638  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-om 7888  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-oi 9550  df-r1 9804  df-rank 9805

This theorem is referenced by:  dfac12lem2  10185