Users' Mathboxes Mathbox for Brendan Leahy < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  poimirlem5 Structured version   Visualization version   GIF version

Theorem poimirlem5 38813
Description: Lemma for poimir 38841 to establish that, for the simplices defined by a walk along the edges of an 𝑁-cube, if the starting vertex is not opposite a given face, it is the earliest vertex of the face on the walk. (Contributed by Brendan Leahy, 21-Aug-2020.)
Hypotheses
Ref Expression
poimir.0 (𝜑 → 𝑁 ∈ ℕ)
poimirlem22.s 𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
poimirlem9.1 (𝜑 → 𝑇 ∈ 𝑆)
poimirlem5.2 (𝜑 → 0 < (2nd ‘𝑇))
Assertion
Ref Expression
poimirlem5 (𝜑 → (𝐹‘0) = (1st ‘(1st ‘𝑇)))
Distinct variable groups:   𝑓,𝑗,𝑡,𝑦   𝜑,𝑗,𝑦   𝑗,𝐹,𝑦   𝑗,𝑁,𝑦   𝑇,𝑗,𝑦   𝜑,𝑡   𝑓,𝐾,𝑗,𝑡   𝑓,𝑁,𝑡   𝑇,𝑓   𝑓,𝐹,𝑡   𝑡,𝑇   𝑆,𝑗,𝑡,𝑦
Allowed substitution hints:   𝜑(𝑓)   𝑆(𝑓)   𝐾(𝑦)

Proof of Theorem poimirlem5
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 poimirlem9.1 . . . 4 (𝜑 → 𝑇 ∈ 𝑆)
2 fveq2 6915 . . . . . . . . . . . 12 (𝑡 = 𝑇 → (2nd ‘𝑡) = (2nd ‘𝑇))
32breq2d 5119 . . . . . . . . . . 11 (𝑡 = 𝑇 → (𝑦 < (2nd ‘𝑡) ↔ 𝑦 < (2nd ‘𝑇)))
43ifbid 4508 . . . . . . . . . 10 (𝑡 = 𝑇 → if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) = if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)))
54csbeq1d 3854 . . . . . . . . 9 (𝑡 = 𝑇 → ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))
6 2fveq3 6920 . . . . . . . . . . 11 (𝑡 = 𝑇 → (1st ‘(1st ‘𝑡)) = (1st ‘(1st ‘𝑇)))
7 2fveq3 6920 . . . . . . . . . . . . . 14 (𝑡 = 𝑇 → (2nd ‘(1st ‘𝑡)) = (2nd ‘(1st ‘𝑇)))
87imaeq1d 6068 . . . . . . . . . . . . 13 (𝑡 = 𝑇 → ((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) = ((2nd ‘(1st ‘𝑇)) “ (1...𝑗)))
98xpeq1d 5686 . . . . . . . . . . . 12 (𝑡 = 𝑇 → (((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}))
107imaeq1d 6068 . . . . . . . . . . . . 13 (𝑡 = 𝑇 → ((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)))
1110xpeq1d 5686 . . . . . . . . . . . 12 (𝑡 = 𝑇 → (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))
129, 11uneq12d 4170 . . . . . . . . . . 11 (𝑡 = 𝑇 → ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))
136, 12oveq12d 7468 . . . . . . . . . 10 (𝑡 = 𝑇 → ((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
1413csbeq2dv 3857 . . . . . . . . 9 (𝑡 = 𝑇 → ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
155, 14eqtrd 2801 . . . . . . . 8 (𝑡 = 𝑇 → ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
1615mpteq2dv 5204 . . . . . . 7 (𝑡 = 𝑇 → (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
1716eqeq2d 2777 . . . . . 6 (𝑡 = 𝑇 → (𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) ↔ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
18 poimirlem22.s . . . . . 6 𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
1917, 18elrab2 3651 . . . . 5 (𝑇 ∈ 𝑆 ↔ (𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)) ∧ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
2019simprbi 503 . . . 4 (𝑇 ∈ 𝑆 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
211, 20syl 18 . . 3 (𝜑 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
22 breq1 5110 . . . . . . 7 (𝑦 = 0 → (𝑦 < (2nd ‘𝑇) ↔ 0 < (2nd ‘𝑇)))
23 id 23 . . . . . . 7 (𝑦 = 0 → 𝑦 = 0)
2422, 23ifbieq1d 4509 . . . . . 6 (𝑦 = 0 → if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) = if(0 < (2nd ‘𝑇), 0, (𝑦 + 1)))
25 poimirlem5.2 . . . . . . 7 (𝜑 → 0 < (2nd ‘𝑇))
2625iftrued 4492 . . . . . 6 (𝜑 → if(0 < (2nd ‘𝑇), 0, (𝑦 + 1)) = 0)
2724, 26sylan9eqr 2823 . . . . 5 ((𝜑 ∧ 𝑦 = 0) → if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) = 0)
2827csbeq1d 3854 . . . 4 ((𝜑 ∧ 𝑦 = 0) → ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋0 / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
29 c0ex 11338 . . . . . . 7 0 ∈ V
30 oveq2 7458 . . . . . . . . . . . . 13 (𝑗 = 0 → (1...𝑗) = (1...0))
31 fz10 13717 . . . . . . . . . . . . 13 (1...0) = ∅
3230, 31eqtrdi 2817 . . . . . . . . . . . 12 (𝑗 = 0 → (1...𝑗) = ∅)
3332imaeq2d 6069 . . . . . . . . . . 11 (𝑗 = 0 → ((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) = ((2nd ‘(1st ‘𝑇)) “ ∅))
3433xpeq1d 5686 . . . . . . . . . 10 (𝑗 = 0 → (((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) = (((2nd ‘(1st ‘𝑇)) “ ∅) × {1}))
35 oveq1 7457 . . . . . . . . . . . . . 14 (𝑗 = 0 → (𝑗 + 1) = (0 + 1))
36 0p1e1 12502 . . . . . . . . . . . . . 14 (0 + 1) = 1
3735, 36eqtrdi 2817 . . . . . . . . . . . . 13 (𝑗 = 0 → (𝑗 + 1) = 1)
3837oveq1d 7465 . . . . . . . . . . . 12 (𝑗 = 0 → ((𝑗 + 1)...𝑁) = (1...𝑁))
3938imaeq2d 6069 . . . . . . . . . . 11 (𝑗 = 0 → ((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) = ((2nd ‘(1st ‘𝑇)) “ (1...𝑁)))
4039xpeq1d 5686 . . . . . . . . . 10 (𝑗 = 0 → (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0}))
4134, 40uneq12d 4170 . . . . . . . . 9 (𝑗 = 0 → ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2nd ‘(1st ‘𝑇)) “ ∅) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0})))
42 ima0 6092 . . . . . . . . . . . . 13 ((2nd ‘(1st ‘𝑇)) “ ∅) = ∅
4342xpeq1i 5683 . . . . . . . . . . . 12 (((2nd ‘(1st ‘𝑇)) “ ∅) × {1}) = (∅ × {1})
44 0xp 5757 . . . . . . . . . . . 12 (∅ × {1}) = ∅
4543, 44eqtri 2789 . . . . . . . . . . 11 (((2nd ‘(1st ‘𝑇)) “ ∅) × {1}) = ∅
4645uneq1i 4165 . . . . . . . . . 10 ((((2nd ‘(1st ‘𝑇)) “ ∅) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0})) = (∅ ∪ (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0}))
47 uncom 4159 . . . . . . . . . 10 (∅ ∪ (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0})) = ((((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0}) ∪ ∅)
48 un0 4346 . . . . . . . . . 10 ((((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0}) ∪ ∅) = (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0})
4946, 47, 483eqtri 2793 . . . . . . . . 9 ((((2nd ‘(1st ‘𝑇)) “ ∅) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0})) = (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0})
5041, 49eqtrdi 2817 . . . . . . . 8 (𝑗 = 0 → ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})) = (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0}))
5150oveq2d 7466 . . . . . . 7 (𝑗 = 0 → ((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0})))
5229, 51csbie 3885 . . . . . 6 ⦋0 / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0}))
53 elrabi 3643 . . . . . . . . . . . . . . 15 (𝑇 ∈ {𝑡 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))} → 𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)))
5453, 18eleq2s 2885 . . . . . . . . . . . . . 14 (𝑇 ∈ 𝑆 → 𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)))
551, 54syl 18 . . . . . . . . . . . . 13 (𝜑 → 𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)))
56 xp1st 8066 . . . . . . . . . . . . 13 (𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)) → (1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}))
5755, 56syl 18 . . . . . . . . . . . 12 (𝜑 → (1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}))
58 xp2nd 8067 . . . . . . . . . . . 12 ((1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) → (2nd ‘(1st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)})
5957, 58syl 18 . . . . . . . . . . 11 (𝜑 → (2nd ‘(1st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)})
60 fvex 6928 . . . . . . . . . . . 12 (2nd ‘(1st ‘𝑇)) ∈ V
61 f1oeq1 6841 . . . . . . . . . . . 12 (𝑓 = (2nd ‘(1st ‘𝑇)) → (𝑓:(1...𝑁)⟶1-1onto(1...𝑁) ↔ (2nd ‘(1st ‘𝑇)):(1...𝑁)⟶1-1onto(1...𝑁)))
6260, 61elab 3635 . . . . . . . . . . 11 ((2nd ‘(1st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)} ↔ (2nd ‘(1st ‘𝑇)):(1...𝑁)⟶1-1onto(1...𝑁))
6359, 62sylib 221 . . . . . . . . . 10 (𝜑 → (2nd ‘(1st ‘𝑇)):(1...𝑁)⟶1-1onto(1...𝑁))
64 f1ofo 6861 . . . . . . . . . 10 ((2nd ‘(1st ‘𝑇)):(1...𝑁)⟶1-1onto(1...𝑁) → (2nd ‘(1st ‘𝑇)):(1...𝑁)⟶onto(1...𝑁))
6563, 64syl 18 . . . . . . . . 9 (𝜑 → (2nd ‘(1st ‘𝑇)):(1...𝑁)⟶onto(1...𝑁))
66 foima 6830 . . . . . . . . 9 ((2nd ‘(1st ‘𝑇)):(1...𝑁)⟶onto(1...𝑁) → ((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
6765, 66syl 18 . . . . . . . 8 (𝜑 → ((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
6867xpeq1d 5686 . . . . . . 7 (𝜑 → (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0}) = ((1...𝑁) × {0}))
6968oveq2d 7466 . . . . . 6 (𝜑 → ((1st ‘(1st ‘𝑇)) ∘f + (((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) × {0})) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {0})))
7052, 69eqtrid 2813 . . . . 5 (𝜑 → ⦋0 / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {0})))
7170adantr 486 . . . 4 ((𝜑 ∧ 𝑦 = 0) → ⦋0 / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {0})))
7228, 71eqtrd 2801 . . 3 ((𝜑 ∧ 𝑦 = 0) → ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {0})))
73 poimir.0 . . . . 5 (𝜑 → 𝑁 ∈ ℕ)
74 nnm1nn0 12686 . . . . 5 (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0)
7573, 74syl 18 . . . 4 (𝜑 → (𝑁 − 1) ∈ ℕ0)
76 0elfz 13797 . . . 4 ((𝑁 − 1) ∈ ℕ0 → 0 ∈ (0...(𝑁 − 1)))
7775, 76syl 18 . . 3 (𝜑 → 0 ∈ (0...(𝑁 − 1)))
78 ovexd 7485 . . 3 (𝜑 → ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {0})) ∈ V)
7921, 72, 77, 78fvmptd 7031 . 2 (𝜑 → (𝐹‘0) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {0})))
80 ovexd 7485 . . 3 (𝜑 → (1...𝑁) ∈ V)
81 xp1st 8066 . . . . 5 ((1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) → (1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)))
8257, 81syl 18 . . . 4 (𝜑 → (1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)))
83 elmapfn 8924 . . . 4 ((1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)) → (1st ‘(1st ‘𝑇)) Fn (1...𝑁))
8482, 83syl 18 . . 3 (𝜑 → (1st ‘(1st ‘𝑇)) Fn (1...𝑁))
85 fnconstg 6799 . . . 4 (0 ∈ V → ((1...𝑁) × {0}) Fn (1...𝑁))
8629, 85mp1i 14 . . 3 (𝜑 → ((1...𝑁) × {0}) Fn (1...𝑁))
87 eqidd 2767 . . 3 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1st ‘(1st ‘𝑇))‘𝑛) = ((1st ‘(1st ‘𝑇))‘𝑛))
8829fvconst2 7240 . . . 4 (𝑛 ∈ (1...𝑁) → (((1...𝑁) × {0})‘𝑛) = 0)
8988adantl 487 . . 3 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1...𝑁) × {0})‘𝑛) = 0)
90 elmapi 8906 . . . . . . . 8 ((1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)) → (1st ‘(1st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
9182, 90syl 18 . . . . . . 7 (𝜑 → (1st ‘(1st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
9291ffvelcdmda 7115 . . . . . 6 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1st ‘(1st ‘𝑇))‘𝑛) ∈ (0..^𝐾))
93 elfzonn0 13881 . . . . . 6 (((1st ‘(1st ‘𝑇))‘𝑛) ∈ (0..^𝐾) → ((1st ‘(1st ‘𝑇))‘𝑛) ∈ ℕ0)
9492, 93syl 18 . . . . 5 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1st ‘(1st ‘𝑇))‘𝑛) ∈ ℕ0)
9594nn0cnd 12708 . . . 4 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1st ‘(1st ‘𝑇))‘𝑛) ∈ ℂ)
9695addridd 11548 . . 3 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1st ‘(1st ‘𝑇))‘𝑛) + 0) = ((1st ‘(1st ‘𝑇))‘𝑛))
9780, 84, 86, 84, 87, 89, 96offveq 7750 . 2 (𝜑 → ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {0})) = (1st ‘(1st ‘𝑇)))
9879, 97eqtrd 2801 1 (𝜑 → (𝐹‘0) = (1st ‘(1st ‘𝑇)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  {cab 2744  {crab 3415  Vcvv 3453  ⦋csb 3850   ∪ cun 4151  ∅c0 4280  ifcif 4484  {csn 4587   class class class wbr 5107   ↦ cmpt 5191   × cxp 5655   “ cima 5660   Fn wfn 6560  ⟶wf 6561  ⟶ontowfo 6563  ⟶1-1ontowf1o 6564  ‘cfv 6565  (class class class)co 7450   ∘f cof 7722  1st c1st 8032  2nd c2nd 8033   ↑m cmap 8884  0cc0 11238  1c1 11239   + caddc 11241   < clt 11381   − cmin 11579  ℕcn 12374  ℕ0cn0 12645  ...cfz 13678  ..^cfzo 13827
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-of 7724  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-er 8754  df-map 8886  df-en 9011  df-dom 9012  df-sdom 9013  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-n0 12646  df-z 12733  df-uz 13005  df-fz 13679  df-fzo 13828
This theorem is used by:  poimirlem12  38820  poimirlem14  38822
  Copyright terms: Public domain W3C validator