MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfac12lem1 Structured version   Visualization version   GIF version

Theorem dfac12lem1 10143
Description: Lemma for dfac12 10149. (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
StepHypRef 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 𝑥)) “ 𝑦))))))
32tfr2 8391 . . 3 (𝐶 ∈ On → (𝐺𝐶) = ((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = dom 𝑥, ((suc ran ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) “ 𝑦)))))‘(𝐺𝐶)))
41, 3syl 18 . 2 (𝜑 → (𝐺𝐶) = ((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅1‘dom 𝑥) ↦ if(dom 𝑥 = dom 𝑥, ((suc ran ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) “ 𝑦)))))‘(𝐺𝐶)))
52tfr1 8390 . . . . 5 𝐺 Fn On
6 fnfun 6639 . . . . 5 (𝐺 Fn On → Fun 𝐺)
75, 6ax-mp 5 . . . 4 Fun 𝐺
8 resfunexg 7220 . . . 4 ((Fun 𝐺𝐶 ∈ On) → (𝐺𝐶) ∈ V)
97, 1, 8sylancr 599 . . 3 (𝜑 → (𝐺𝐶) ∈ V)
10 dmeq 5895 . . . . . 6 (𝑥 = (𝐺𝐶) → dom 𝑥 = dom (𝐺𝐶))
1110fveq2d 6889 . . . . 5 (𝑥 = (𝐺𝐶) → (𝑅1‘dom 𝑥) = (𝑅1‘dom (𝐺𝐶)))
1210unieqd 4887 . . . . . . 7 (𝑥 = (𝐺𝐶) → dom 𝑥 = dom (𝐺𝐶))
1310, 12eqeq12d 2781 . . . . . 6 (𝑥 = (𝐺𝐶) → (dom 𝑥 = dom 𝑥 ↔ dom (𝐺𝐶) = dom (𝐺𝐶)))
14 rneq 5928 . . . . . . . . . . . . 13 (𝑥 = (𝐺𝐶) → ran 𝑥 = ran (𝐺𝐶))
15 df-ima 5676 . . . . . . . . . . . . 13 (𝐺𝐶) = ran (𝐺𝐶)
1614, 15eqtr4di 2818 . . . . . . . . . . . 12 (𝑥 = (𝐺𝐶) → ran 𝑥 = (𝐺𝐶))
1716unieqd 4887 . . . . . . . . . . 11 (𝑥 = (𝐺𝐶) → ran 𝑥 = (𝐺𝐶))
1817rneqd 5930 . . . . . . . . . 10 (𝑥 = (𝐺𝐶) → ran ran 𝑥 = ran (𝐺𝐶))
1918unieqd 4887 . . . . . . . . 9 (𝑥 = (𝐺𝐶) → ran ran 𝑥 = ran (𝐺𝐶))
20 suceq 6433 . . . . . . . . 9 ( ran ran 𝑥 = ran (𝐺𝐶) → suc ran ran 𝑥 = suc ran (𝐺𝐶))
2119, 20syl 18 . . . . . . . 8 (𝑥 = (𝐺𝐶) → suc ran ran 𝑥 = suc ran (𝐺𝐶))
2221oveq1d 7434 . . . . . . 7 (𝑥 = (𝐺𝐶) → (suc ran ran 𝑥 ·o (rank‘𝑦)) = (suc ran (𝐺𝐶) ·o (rank‘𝑦)))
23 fveq1 6884 . . . . . . . 8 (𝑥 = (𝐺𝐶) → (𝑥‘suc (rank‘𝑦)) = ((𝐺𝐶)‘suc (rank‘𝑦)))
2423fveq1d 6887 . . . . . . 7 (𝑥 = (𝐺𝐶) → ((𝑥‘suc (rank‘𝑦))‘𝑦) = (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦))
2522, 24oveq12d 7437 . . . . . 6 (𝑥 = (𝐺𝐶) → ((suc ran ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)) = ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦)))
26 id 23 . . . . . . . . . . . . 13 (𝑥 = (𝐺𝐶) → 𝑥 = (𝐺𝐶))
2726, 12fveq12d 6892 . . . . . . . . . . . 12 (𝑥 = (𝐺𝐶) → (𝑥 dom 𝑥) = ((𝐺𝐶)‘ dom (𝐺𝐶)))
2827rneqd 5930 . . . . . . . . . . 11 (𝑥 = (𝐺𝐶) → ran (𝑥 dom 𝑥) = ran ((𝐺𝐶)‘ dom (𝐺𝐶)))
29 oieq2 9482 . . . . . . . . . . 11 (ran (𝑥 dom 𝑥) = ran ((𝐺𝐶)‘ dom (𝐺𝐶)) → OrdIso( E , ran (𝑥 dom 𝑥)) = OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))))
3028, 29syl 18 . . . . . . . . . 10 (𝑥 = (𝐺𝐶) → OrdIso( E , ran (𝑥 dom 𝑥)) = OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))))
3130cnveqd 5863 . . . . . . . . 9 (𝑥 = (𝐺𝐶) → OrdIso( E , ran (𝑥 dom 𝑥)) = OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))))
3231, 27coeq12d 5852 . . . . . . . 8 (𝑥 = (𝐺𝐶) → (OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) = (OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))))
3332imaeq1d 6063 . . . . . . 7 (𝑥 = (𝐺𝐶) → ((OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) “ 𝑦) = ((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦))
3433fveq2d 6889 . . . . . 6 (𝑥 = (𝐺𝐶) → (𝐹‘((OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) “ 𝑦)) = (𝐹‘((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦)))
3513, 25, 34ifbieq12d 4518 . . . . 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 (𝐺𝐶))) “ 𝑦))))
3611, 35mpteq12dv 5200 . . . 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 2765 . . . 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 6898 . . . . 5 (𝑅1‘dom (𝐺𝐶)) ∈ V
3938mptex 7228 . . . 4 (𝑦 ∈ (𝑅1‘dom (𝐺𝐶)) ↦ if(dom (𝐺𝐶) = dom (𝐺𝐶), ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦)))) ∈ V
4036, 37, 39fvmpt 6993 . . 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 (𝐺𝐶))) “ 𝑦)))))
419, 40syl 18 . 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 7790 . . . . . . . 8 (𝐶 ∈ On → 𝐶 ⊆ On)
431, 42syl 18 . . . . . . 7 (𝜑𝐶 ⊆ On)
44 fnssres 6662 . . . . . . 7 ((𝐺 Fn On ∧ 𝐶 ⊆ On) → (𝐺𝐶) Fn 𝐶)
455, 43, 44sylancr 599 . . . . . 6 (𝜑 → (𝐺𝐶) Fn 𝐶)
4645fndmd 6644 . . . . 5 (𝜑 → dom (𝐺𝐶) = 𝐶)
4746fveq2d 6889 . . . 4 (𝜑 → (𝑅1‘dom (𝐺𝐶)) = (𝑅1𝐶))
4847mpteq1d 5203 . . 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 (𝐺𝐶))) “ 𝑦)))))
4946adantr 486 . . . . . . 7 ((𝜑𝑦 ∈ (𝑅1𝐶)) → dom (𝐺𝐶) = 𝐶)
5049unieqd 4887 . . . . . . 7 ((𝜑𝑦 ∈ (𝑅1𝐶)) → dom (𝐺𝐶) = 𝐶)
5149, 50eqeq12d 2781 . . . . . 6 ((𝜑𝑦 ∈ (𝑅1𝐶)) → (dom (𝐺𝐶) = dom (𝐺𝐶) ↔ 𝐶 = 𝐶))
5251ifbid 4513 . . . . 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 9777 . . . . . . . . . . . 12 (𝑦 ∈ (𝑅1𝐶) → (rank‘𝑦) ∈ 𝐶)
5453ad2antlr 740 . . . . . . . . . . 11 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → (rank‘𝑦) ∈ 𝐶)
55 simpr 490 . . . . . . . . . . 11 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → 𝐶 = 𝐶)
5654, 55eleqtrd 2867 . . . . . . . . . 10 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → (rank‘𝑦) ∈ 𝐶)
57 eloni 6374 . . . . . . . . . . . 12 (𝐶 ∈ On → Ord 𝐶)
58 ordsucuniel 7826 . . . . . . . . . . . 12 (Ord 𝐶 → ((rank‘𝑦) ∈ 𝐶 ↔ suc (rank‘𝑦) ∈ 𝐶))
591, 57, 583syl 19 . . . . . . . . . . 11 (𝜑 → ((rank‘𝑦) ∈ 𝐶 ↔ suc (rank‘𝑦) ∈ 𝐶))
6059ad2antrr 739 . . . . . . . . . 10 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → ((rank‘𝑦) ∈ 𝐶 ↔ suc (rank‘𝑦) ∈ 𝐶))
6156, 60mpbid 235 . . . . . . . . 9 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → suc (rank‘𝑦) ∈ 𝐶)
6261fvresd 6905 . . . . . . . 8 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → ((𝐺𝐶)‘suc (rank‘𝑦)) = (𝐺‘suc (rank‘𝑦)))
6362fveq1d 6887 . . . . . . 7 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦) = ((𝐺‘suc (rank‘𝑦))‘𝑦))
6463oveq2d 7435 . . . . . 6 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦)) = ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)))
6564ifeq1da 4521 . . . . 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 (𝐺𝐶))) “ 𝑦))))
6650adantr 486 . . . . . . . . . . . . . . 15 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → dom (𝐺𝐶) = 𝐶)
6766fveq2d 6889 . . . . . . . . . . . . . 14 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ((𝐺𝐶)‘ dom (𝐺𝐶)) = ((𝐺𝐶)‘ 𝐶))
681ad2antrr 739 . . . . . . . . . . . . . . . . 17 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → 𝐶 ∈ On)
69 uniexg 7748 . . . . . . . . . . . . . . . . 17 (𝐶 ∈ On → 𝐶 ∈ V)
70 sucidg 6448 . . . . . . . . . . . . . . . . 17 ( 𝐶 ∈ V → 𝐶 ∈ suc 𝐶)
7168, 69, 703syl 19 . . . . . . . . . . . . . . . 16 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → 𝐶 ∈ suc 𝐶)
721adantr 486 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑦 ∈ (𝑅1𝐶)) → 𝐶 ∈ On)
73 orduniorsuc 7832 . . . . . . . . . . . . . . . . . 18 (Ord 𝐶 → (𝐶 = 𝐶𝐶 = suc 𝐶))
7472, 57, 733syl 19 . . . . . . . . . . . . . . . . 17 ((𝜑𝑦 ∈ (𝑅1𝐶)) → (𝐶 = 𝐶𝐶 = suc 𝐶))
7574orcanai 1018 . . . . . . . . . . . . . . . 16 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → 𝐶 = suc 𝐶)
7671, 75eleqtrrd 2868 . . . . . . . . . . . . . . 15 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → 𝐶𝐶)
7776fvresd 6905 . . . . . . . . . . . . . 14 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ((𝐺𝐶)‘ 𝐶) = (𝐺 𝐶))
7867, 77eqtrd 2800 . . . . . . . . . . . . 13 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ((𝐺𝐶)‘ dom (𝐺𝐶)) = (𝐺 𝐶))
7978rneqd 5930 . . . . . . . . . . . 12 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ran ((𝐺𝐶)‘ dom (𝐺𝐶)) = ran (𝐺 𝐶))
80 oieq2 9482 . . . . . . . . . . . 12 (ran ((𝐺𝐶)‘ dom (𝐺𝐶)) = ran (𝐺 𝐶) → OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) = OrdIso( E , ran (𝐺 𝐶)))
8179, 80syl 18 . . . . . . . . . . 11 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) = OrdIso( E , ran (𝐺 𝐶)))
8281cnveqd 5863 . . . . . . . . . 10 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) = OrdIso( E , ran (𝐺 𝐶)))
8382, 78coeq12d 5852 . . . . . . . . 9 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → (OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) = (OrdIso( E , ran (𝐺 𝐶)) ∘ (𝐺 𝐶)))
84 dfac12.h . . . . . . . . 9 𝐻 = (OrdIso( E , ran (𝐺 𝐶)) ∘ (𝐺 𝐶))
8583, 84eqtr4di 2818 . . . . . . . 8 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → (OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) = 𝐻)
8685imaeq1d 6063 . . . . . . 7 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦) = (𝐻𝑦))
8786fveq2d 6889 . . . . . 6 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → (𝐹‘((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦)) = (𝐹‘(𝐻𝑦)))
8887ifeq2da 4522 . . . . 5 ((𝜑𝑦 ∈ (𝑅1𝐶)) → if(𝐶 = 𝐶, ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦))) = if(𝐶 = 𝐶, ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻𝑦))))
8952, 65, 883eqtrd 2804 . . . 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‘𝑦))‘𝑦)), (𝐹‘(𝐻𝑦))))
9089mpteq2dva 5206 . . 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‘𝑦))‘𝑦)), (𝐹‘(𝐻𝑦)))))
9148, 90eqtrd 2800 . 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‘𝑦))‘𝑦)), (𝐹‘(𝐻𝑦)))))
924, 41, 913eqtrd 2804 1 (𝜑 → (𝐺𝐶) = (𝑦 ∈ (𝑅1𝐶) ↦ if(𝐶 = 𝐶, ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)), (𝐹‘(𝐻𝑦)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wo 861   = wceq 1570  wcel 2146  Vcvv 3457  wss 3906  ifcif 4489  𝒫 cpw 4564   cuni 4874  cmpt 5194   E cep 5562  ccnv 5662  dom cdm 5663  ran crn 5664  cres 5665  cima 5666  ccom 5667  Ord word 6363  Oncon0 6364  suc csuc 6366  Fun wfun 6534   Fn wfn 6535  1-1wf1 6537  cfv 6540  (class class class)co 7419  recscrecs 8363   +o coa 8456   ·o comu 8457  OrdIsocoi 9478  harchar 9525  𝑅1cr1 9741  rankcrnk 9742
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-oi 9479  df-r1 9743  df-rank 9744
This theorem is used by:  dfac12lem2  10144
  Copyright terms: Public domain W3C validator