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

Theorem dfac12lem1 10168
Description: Lemma for dfac12 10174. (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 8389 . . 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 8388 . . . . 5 𝐺 Fn On
6 fnfun 6634 . . . . 5 (𝐺 Fn On → Fun 𝐺)
75, 6ax-mp 5 . . . 4 Fun 𝐺
8 resfunexg 7216 . . . 4 ((Fun 𝐺𝐶 ∈ On) → (𝐺𝐶) ∈ V)
97, 1, 8sylancr 599 . . 3 (𝜑 → (𝐺𝐶) ∈ V)
10 dmeq 5888 . . . . . 6 (𝑥 = (𝐺𝐶) → dom 𝑥 = dom (𝐺𝐶))
1110fveq2d 6884 . . . . 5 (𝑥 = (𝐺𝐶) → (𝑅1‘dom 𝑥) = (𝑅1‘dom (𝐺𝐶)))
1210unieqd 4880 . . . . . . 7 (𝑥 = (𝐺𝐶) → dom 𝑥 = dom (𝐺𝐶))
1310, 12eqeq12d 2776 . . . . . 6 (𝑥 = (𝐺𝐶) → (dom 𝑥 = dom 𝑥 ↔ dom (𝐺𝐶) = dom (𝐺𝐶)))
14 rneq 5921 . . . . . . . . . . . . 13 (𝑥 = (𝐺𝐶) → ran 𝑥 = ran (𝐺𝐶))
15 df-ima 5668 . . . . . . . . . . . . 13 (𝐺𝐶) = ran (𝐺𝐶)
1614, 15eqtr4di 2813 . . . . . . . . . . . 12 (𝑥 = (𝐺𝐶) → ran 𝑥 = (𝐺𝐶))
1716unieqd 4880 . . . . . . . . . . 11 (𝑥 = (𝐺𝐶) → ran 𝑥 = (𝐺𝐶))
1817rneqd 5923 . . . . . . . . . 10 (𝑥 = (𝐺𝐶) → ran ran 𝑥 = ran (𝐺𝐶))
1918unieqd 4880 . . . . . . . . 9 (𝑥 = (𝐺𝐶) → ran ran 𝑥 = ran (𝐺𝐶))
20 suceq 6427 . . . . . . . . 9 ( ran ran 𝑥 = ran (𝐺𝐶) → suc ran ran 𝑥 = suc ran (𝐺𝐶))
2119, 20syl 18 . . . . . . . 8 (𝑥 = (𝐺𝐶) → suc ran ran 𝑥 = suc ran (𝐺𝐶))
2221oveq1d 7430 . . . . . . 7 (𝑥 = (𝐺𝐶) → (suc ran ran 𝑥 ·o (rank‘𝑦)) = (suc ran (𝐺𝐶) ·o (rank‘𝑦)))
23 fveq1 6879 . . . . . . . 8 (𝑥 = (𝐺𝐶) → (𝑥‘suc (rank‘𝑦)) = ((𝐺𝐶)‘suc (rank‘𝑦)))
2423fveq1d 6882 . . . . . . 7 (𝑥 = (𝐺𝐶) → ((𝑥‘suc (rank‘𝑦))‘𝑦) = (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦))
2522, 24oveq12d 7433 . . . . . 6 (𝑥 = (𝐺𝐶) → ((suc ran ran 𝑥 ·o (rank‘𝑦)) +o ((𝑥‘suc (rank‘𝑦))‘𝑦)) = ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦)))
26 id 23 . . . . . . . . . . . . 13 (𝑥 = (𝐺𝐶) → 𝑥 = (𝐺𝐶))
2726, 12fveq12d 6887 . . . . . . . . . . . 12 (𝑥 = (𝐺𝐶) → (𝑥 dom 𝑥) = ((𝐺𝐶)‘ dom (𝐺𝐶)))
2827rneqd 5923 . . . . . . . . . . 11 (𝑥 = (𝐺𝐶) → ran (𝑥 dom 𝑥) = ran ((𝐺𝐶)‘ dom (𝐺𝐶)))
29 oieq2 9489 . . . . . . . . . . 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 5856 . . . . . . . . 9 (𝑥 = (𝐺𝐶) → OrdIso( E , ran (𝑥 dom 𝑥)) = OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))))
3231, 27coeq12d 5845 . . . . . . . 8 (𝑥 = (𝐺𝐶) → (OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) = (OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))))
3332imaeq1d 6056 . . . . . . 7 (𝑥 = (𝐺𝐶) → ((OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) “ 𝑦) = ((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦))
3433fveq2d 6884 . . . . . 6 (𝑥 = (𝐺𝐶) → (𝐹‘((OrdIso( E , ran (𝑥 dom 𝑥)) ∘ (𝑥 dom 𝑥)) “ 𝑦)) = (𝐹‘((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦)))
3513, 25, 34ifbieq12d 4511 . . . . 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 5192 . . . 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 2760 . . . 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 6893 . . . . 5 (𝑅1‘dom (𝐺𝐶)) ∈ V
3938mptex 7224 . . . 4 (𝑦 ∈ (𝑅1‘dom (𝐺𝐶)) ↦ if(dom (𝐺𝐶) = dom (𝐺𝐶), ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦)))) ∈ V
4036, 37, 39fvmpt 6988 . . 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 7786 . . . . . . . 8 (𝐶 ∈ On → 𝐶 ⊆ On)
431, 42syl 18 . . . . . . 7 (𝜑𝐶 ⊆ On)
44 fnssres 6657 . . . . . . 7 ((𝐺 Fn On ∧ 𝐶 ⊆ On) → (𝐺𝐶) Fn 𝐶)
455, 43, 44sylancr 599 . . . . . 6 (𝜑 → (𝐺𝐶) Fn 𝐶)
4645fndmd 6639 . . . . 5 (𝜑 → dom (𝐺𝐶) = 𝐶)
4746fveq2d 6884 . . . 4 (𝜑 → (𝑅1‘dom (𝐺𝐶)) = (𝑅1𝐶))
4847mpteq1d 5195 . . 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 4880 . . . . . . 7 ((𝜑𝑦 ∈ (𝑅1𝐶)) → dom (𝐺𝐶) = 𝐶)
5149, 50eqeq12d 2776 . . . . . 6 ((𝜑𝑦 ∈ (𝑅1𝐶)) → (dom (𝐺𝐶) = dom (𝐺𝐶) ↔ 𝐶 = 𝐶))
5251ifbid 4506 . . . . 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 9784 . . . . . . . . . . . 12 (𝑦 ∈ (𝑅1𝐶) → (rank‘𝑦) ∈ 𝐶)
5453ad2antlr 740 . . . . . . . . . . 11 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → (rank‘𝑦) ∈ 𝐶)
55 simpr 490 . . . . . . . . . . 11 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → 𝐶 = 𝐶)
5654, 55eleqtrd 2862 . . . . . . . . . 10 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → (rank‘𝑦) ∈ 𝐶)
57 eloni 6368 . . . . . . . . . . . 12 (𝐶 ∈ On → Ord 𝐶)
58 ordsucuniel 7822 . . . . . . . . . . . 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 6900 . . . . . . . 8 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → ((𝐺𝐶)‘suc (rank‘𝑦)) = (𝐺‘suc (rank‘𝑦)))
6362fveq1d 6882 . . . . . . 7 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦) = ((𝐺‘suc (rank‘𝑦))‘𝑦))
6463oveq2d 7431 . . . . . 6 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ 𝐶 = 𝐶) → ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o (((𝐺𝐶)‘suc (rank‘𝑦))‘𝑦)) = ((suc ran (𝐺𝐶) ·o (rank‘𝑦)) +o ((𝐺‘suc (rank‘𝑦))‘𝑦)))
6564ifeq1da 4514 . . . . 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 6884 . . . . . . . . . . . . . 14 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ((𝐺𝐶)‘ dom (𝐺𝐶)) = ((𝐺𝐶)‘ 𝐶))
681ad2antrr 739 . . . . . . . . . . . . . . . . 17 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → 𝐶 ∈ On)
69 uniexg 7744 . . . . . . . . . . . . . . . . 17 (𝐶 ∈ On → 𝐶 ∈ V)
70 sucidg 6442 . . . . . . . . . . . . . . . . 17 ( 𝐶 ∈ V → 𝐶 ∈ suc 𝐶)
7168, 69, 703syl 19 . . . . . . . . . . . . . . . 16 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → 𝐶 ∈ suc 𝐶)
721adantr 486 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑦 ∈ (𝑅1𝐶)) → 𝐶 ∈ On)
73 orduniorsuc 7828 . . . . . . . . . . . . . . . . . 18 (Ord 𝐶 → (𝐶 = 𝐶𝐶 = suc 𝐶))
7472, 57, 733syl 19 . . . . . . . . . . . . . . . . 17 ((𝜑𝑦 ∈ (𝑅1𝐶)) → (𝐶 = 𝐶𝐶 = suc 𝐶))
7574orcanai 1018 . . . . . . . . . . . . . . . 16 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → 𝐶 = suc 𝐶)
7671, 75eleqtrrd 2863 . . . . . . . . . . . . . . 15 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → 𝐶𝐶)
7776fvresd 6900 . . . . . . . . . . . . . 14 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ((𝐺𝐶)‘ 𝐶) = (𝐺 𝐶))
7867, 77eqtrd 2795 . . . . . . . . . . . . 13 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ((𝐺𝐶)‘ dom (𝐺𝐶)) = (𝐺 𝐶))
7978rneqd 5923 . . . . . . . . . . . 12 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ran ((𝐺𝐶)‘ dom (𝐺𝐶)) = ran (𝐺 𝐶))
80 oieq2 9489 . . . . . . . . . . . 12 (ran ((𝐺𝐶)‘ dom (𝐺𝐶)) = ran (𝐺 𝐶) → OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) = OrdIso( E , ran (𝐺 𝐶)))
8179, 80syl 18 . . . . . . . . . . 11 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) = OrdIso( E , ran (𝐺 𝐶)))
8281cnveqd 5856 . . . . . . . . . 10 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) = OrdIso( E , ran (𝐺 𝐶)))
8382, 78coeq12d 5845 . . . . . . . . 9 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → (OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) = (OrdIso( E , ran (𝐺 𝐶)) ∘ (𝐺 𝐶)))
84 dfac12.h . . . . . . . . 9 𝐻 = (OrdIso( E , ran (𝐺 𝐶)) ∘ (𝐺 𝐶))
8583, 84eqtr4di 2813 . . . . . . . 8 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → (OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) = 𝐻)
8685imaeq1d 6056 . . . . . . 7 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → ((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦) = (𝐻𝑦))
8786fveq2d 6884 . . . . . 6 (((𝜑𝑦 ∈ (𝑅1𝐶)) ∧ ¬ 𝐶 = 𝐶) → (𝐹‘((OrdIso( E , ran ((𝐺𝐶)‘ dom (𝐺𝐶))) ∘ ((𝐺𝐶)‘ dom (𝐺𝐶))) “ 𝑦)) = (𝐹‘(𝐻𝑦)))
8887ifeq2da 4515 . . . . 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 2799 . . . 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 5198 . . 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 2795 . 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 2799 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 2145  Vcvv 3450  wss 3899  ifcif 4482  𝒫 cpw 4557   cuni 4867  cmpt 5186   E cep 5554  ccnv 5654  dom cdm 5655  ran crn 5656  cres 5657  cima 5658  ccom 5659  Ord word 6357  Oncon0 6358  suc csuc 6360  Fun wfun 6528   Fn wfn 6529  1-1wf1 6531  cfv 6534  (class class class)co 7415  recscrecs 8361   +o coa 8456   ·o comu 8457  OrdIsocoi 9485  harchar 9532  𝑅1cr1 9748  rankcrnk 9749
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 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7738
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6300  df-ord 6361  df-on 6362  df-lim 6363  df-suc 6364  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-riota 7372  df-ov 7418  df-om 7865  df-2nd 7989  df-frecs 8282  df-wrecs 8313  df-recs 8362  df-rdg 8401  df-oi 9486  df-r1 9750  df-rank 9751
This theorem is used by:  dfac12lem2  10169
  Copyright terms: Public domain W3C validator