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

Theorem poimirlem10 38818
Description: Lemma for poimir 38841 establishing the cube that yields the simplex that yields a face if the opposite vertex was first 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}))))}
poimirlem22.1 (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑m (1...𝑁)))
poimirlem12.2 (𝜑 → 𝑇 ∈ 𝑆)
poimirlem11.3 (𝜑 → (2nd ‘𝑇) = 0)
Assertion
Ref Expression
poimirlem10 (𝜑 → ((𝐹‘(𝑁 − 1)) ∘f − ((1...𝑁) × {1})) = (1st ‘(1st ‘𝑇)))
Distinct variable groups:   𝑓,𝑗,𝑡,𝑦   𝜑,𝑗,𝑦   𝑗,𝐹,𝑦   𝑗,𝑁,𝑦   𝑇,𝑗,𝑦   𝜑,𝑡   𝑓,𝐾,𝑗,𝑡   𝑓,𝑁,𝑡   𝑇,𝑓   𝑓,𝐹,𝑡   𝑡,𝑇   𝑆,𝑗,𝑡,𝑦
Allowed substitution hints:   𝜑(𝑓)   𝑆(𝑓)   𝐾(𝑦)

Proof of Theorem poimirlem10
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 ovexd 7485 . 2 (𝜑 → (1...𝑁) ∈ V)
2 poimirlem22.1 . . . 4 (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑m (1...𝑁)))
3 poimir.0 . . . . . 6 (𝜑 → 𝑁 ∈ ℕ)
4 nnm1nn0 12686 . . . . . 6 (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0)
53, 4syl 18 . . . . 5 (𝜑 → (𝑁 − 1) ∈ ℕ0)
6 nn0fz0 13798 . . . . 5 ((𝑁 − 1) ∈ ℕ0 ↔ (𝑁 − 1) ∈ (0...(𝑁 − 1)))
75, 6sylib 221 . . . 4 (𝜑 → (𝑁 − 1) ∈ (0...(𝑁 − 1)))
82, 7ffvelcdmd 7116 . . 3 (𝜑 → (𝐹‘(𝑁 − 1)) ∈ ((0...𝐾) ↑m (1...𝑁)))
9 elmapfn 8924 . . 3 ((𝐹‘(𝑁 − 1)) ∈ ((0...𝐾) ↑m (1...𝑁)) → (𝐹‘(𝑁 − 1)) Fn (1...𝑁))
108, 9syl 18 . 2 (𝜑 → (𝐹‘(𝑁 − 1)) Fn (1...𝑁))
11 1ex 11341 . . 3 1 ∈ V
12 fnconstg 6799 . . 3 (1 ∈ V → ((1...𝑁) × {1}) Fn (1...𝑁))
1311, 12mp1i 14 . 2 (𝜑 → ((1...𝑁) × {1}) Fn (1...𝑁))
14 poimirlem12.2 . . . . . 6 (𝜑 → 𝑇 ∈ 𝑆)
15 elrabi 3643 . . . . . . 7 (𝑇 ∈ {𝑡 ∈ ((((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...𝑁)))
16 poimirlem22.s . . . . . . 7 𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
1715, 16eleq2s 2885 . . . . . 6 (𝑇 ∈ 𝑆 → 𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)))
1814, 17syl 18 . . . . 5 (𝜑 → 𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)))
19 xp1st 8066 . . . . 5 (𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)) → (1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}))
2018, 19syl 18 . . . 4 (𝜑 → (1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}))
21 xp1st 8066 . . . 4 ((1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) → (1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)))
2220, 21syl 18 . . 3 (𝜑 → (1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)))
23 elmapfn 8924 . . 3 ((1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)) → (1st ‘(1st ‘𝑇)) Fn (1...𝑁))
2422, 23syl 18 . 2 (𝜑 → (1st ‘(1st ‘𝑇)) Fn (1...𝑁))
25 fveq2 6915 . . . . . . . . . . . . . . 15 (𝑡 = 𝑇 → (2nd ‘𝑡) = (2nd ‘𝑇))
2625breq2d 5119 . . . . . . . . . . . . . 14 (𝑡 = 𝑇 → (𝑦 < (2nd ‘𝑡) ↔ 𝑦 < (2nd ‘𝑇)))
2726ifbid 4508 . . . . . . . . . . . . 13 (𝑡 = 𝑇 → if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) = if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)))
2827csbeq1d 3854 . . . . . . . . . . . 12 (𝑡 = 𝑇 → ⦋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}))))
29 2fveq3 6920 . . . . . . . . . . . . . 14 (𝑡 = 𝑇 → (1st ‘(1st ‘𝑡)) = (1st ‘(1st ‘𝑇)))
30 2fveq3 6920 . . . . . . . . . . . . . . . . 17 (𝑡 = 𝑇 → (2nd ‘(1st ‘𝑡)) = (2nd ‘(1st ‘𝑇)))
3130imaeq1d 6068 . . . . . . . . . . . . . . . 16 (𝑡 = 𝑇 → ((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) = ((2nd ‘(1st ‘𝑇)) “ (1...𝑗)))
3231xpeq1d 5686 . . . . . . . . . . . . . . 15 (𝑡 = 𝑇 → (((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}))
3330imaeq1d 6068 . . . . . . . . . . . . . . . 16 (𝑡 = 𝑇 → ((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)))
3433xpeq1d 5686 . . . . . . . . . . . . . . 15 (𝑡 = 𝑇 → (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))
3532, 34uneq12d 4170 . . . . . . . . . . . . . 14 (𝑡 = 𝑇 → ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))
3629, 35oveq12d 7468 . . . . . . . . . . . . 13 (𝑡 = 𝑇 → ((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
3736csbeq2dv 3857 . . . . . . . . . . . 12 (𝑡 = 𝑇 → ⦋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}))))
3828, 37eqtrd 2801 . . . . . . . . . . 11 (𝑡 = 𝑇 → ⦋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}))))
3938mpteq2dv 5204 . . . . . . . . . 10 (𝑡 = 𝑇 → (𝑦 ∈ (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})))))
4039eqeq2d 2777 . . . . . . . . 9 (𝑡 = 𝑇 → (𝐹 = (𝑦 ∈ (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}))))))
4140, 16elrab2 3651 . . . . . . . 8 (𝑇 ∈ 𝑆 ↔ (𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) × (0...𝑁)) ∧ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
4241simprbi 503 . . . . . . 7 (𝑇 ∈ 𝑆 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
4314, 42syl 18 . . . . . 6 (𝜑 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
44 poimirlem11.3 . . . . . . . . . . . 12 (𝜑 → (2nd ‘𝑇) = 0)
45 breq12 5112 . . . . . . . . . . . 12 ((𝑦 = (𝑁 − 1) ∧ (2nd ‘𝑇) = 0) → (𝑦 < (2nd ‘𝑇) ↔ (𝑁 − 1) < 0))
4644, 45sylan2 605 . . . . . . . . . . 11 ((𝑦 = (𝑁 − 1) ∧ 𝜑) → (𝑦 < (2nd ‘𝑇) ↔ (𝑁 − 1) < 0))
4746ancoms 464 . . . . . . . . . 10 ((𝜑 ∧ 𝑦 = (𝑁 − 1)) → (𝑦 < (2nd ‘𝑇) ↔ (𝑁 − 1) < 0))
48 oveq1 7457 . . . . . . . . . . 11 (𝑦 = (𝑁 − 1) → (𝑦 + 1) = ((𝑁 − 1) + 1))
493nncnd 12390 . . . . . . . . . . . 12 (𝜑 → 𝑁 ∈ ℂ)
50 npcan1 11779 . . . . . . . . . . . 12 (𝑁 ∈ ℂ → ((𝑁 − 1) + 1) = 𝑁)
5149, 50syl 18 . . . . . . . . . . 11 (𝜑 → ((𝑁 − 1) + 1) = 𝑁)
5248, 51sylan9eqr 2823 . . . . . . . . . 10 ((𝜑 ∧ 𝑦 = (𝑁 − 1)) → (𝑦 + 1) = 𝑁)
5347, 52ifbieq2d 4511 . . . . . . . . 9 ((𝜑 ∧ 𝑦 = (𝑁 − 1)) → if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) = if((𝑁 − 1) < 0, 𝑦, 𝑁))
545nn0ge0d 12709 . . . . . . . . . . . 12 (𝜑 → 0 ≤ (𝑁 − 1))
55 0red 11349 . . . . . . . . . . . . 13 (𝜑 → 0 ∈ ℝ)
565nn0red 12707 . . . . . . . . . . . . 13 (𝜑 → (𝑁 − 1) ∈ ℝ)
5755, 56lenltd 11494 . . . . . . . . . . . 12 (𝜑 → (0 ≤ (𝑁 − 1) ↔ ¬ (𝑁 − 1) < 0))
5854, 57mpbid 235 . . . . . . . . . . 11 (𝜑 → ¬ (𝑁 − 1) < 0)
5958iffalsed 4495 . . . . . . . . . 10 (𝜑 → if((𝑁 − 1) < 0, 𝑦, 𝑁) = 𝑁)
6059adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑦 = (𝑁 − 1)) → if((𝑁 − 1) < 0, 𝑦, 𝑁) = 𝑁)
6153, 60eqtrd 2801 . . . . . . . 8 ((𝜑 ∧ 𝑦 = (𝑁 − 1)) → if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) = 𝑁)
6261csbeq1d 3854 . . . . . . 7 ((𝜑 ∧ 𝑦 = (𝑁 − 1)) → ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋𝑁 / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
63 oveq2 7458 . . . . . . . . . . . . . . 15 (𝑗 = 𝑁 → (1...𝑗) = (1...𝑁))
6463imaeq2d 6069 . . . . . . . . . . . . . 14 (𝑗 = 𝑁 → ((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) = ((2nd ‘(1st ‘𝑇)) “ (1...𝑁)))
65 xp2nd 8067 . . . . . . . . . . . . . . . . 17 ((1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)}) → (2nd ‘(1st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)})
6620, 65syl 18 . . . . . . . . . . . . . . . 16 (𝜑 → (2nd ‘(1st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)})
67 fvex 6928 . . . . . . . . . . . . . . . . 17 (2nd ‘(1st ‘𝑇)) ∈ V
68 f1oeq1 6841 . . . . . . . . . . . . . . . . 17 (𝑓 = (2nd ‘(1st ‘𝑇)) → (𝑓:(1...𝑁)⟶1-1onto(1...𝑁) ↔ (2nd ‘(1st ‘𝑇)):(1...𝑁)⟶1-1onto(1...𝑁)))
6967, 68elab 3635 . . . . . . . . . . . . . . . 16 ((2nd ‘(1st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)⟶1-1onto(1...𝑁)} ↔ (2nd ‘(1st ‘𝑇)):(1...𝑁)⟶1-1onto(1...𝑁))
7066, 69sylib 221 . . . . . . . . . . . . . . 15 (𝜑 → (2nd ‘(1st ‘𝑇)):(1...𝑁)⟶1-1onto(1...𝑁))
71 f1ofo 6861 . . . . . . . . . . . . . . 15 ((2nd ‘(1st ‘𝑇)):(1...𝑁)⟶1-1onto(1...𝑁) → (2nd ‘(1st ‘𝑇)):(1...𝑁)⟶onto(1...𝑁))
72 foima 6830 . . . . . . . . . . . . . . 15 ((2nd ‘(1st ‘𝑇)):(1...𝑁)⟶onto(1...𝑁) → ((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
7370, 71, 723syl 19 . . . . . . . . . . . . . 14 (𝜑 → ((2nd ‘(1st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
7464, 73sylan9eqr 2823 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑗 = 𝑁) → ((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) = (1...𝑁))
7574xpeq1d 5686 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑗 = 𝑁) → (((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) = ((1...𝑁) × {1}))
76 oveq1 7457 . . . . . . . . . . . . . . . . 17 (𝑗 = 𝑁 → (𝑗 + 1) = (𝑁 + 1))
7776oveq1d 7465 . . . . . . . . . . . . . . . 16 (𝑗 = 𝑁 → ((𝑗 + 1)...𝑁) = ((𝑁 + 1)...𝑁))
783nnred 12389 . . . . . . . . . . . . . . . . . 18 (𝜑 → 𝑁 ∈ ℝ)
7978ltp1d 12286 . . . . . . . . . . . . . . . . 17 (𝜑 → 𝑁 < (𝑁 + 1))
803nnzd 12758 . . . . . . . . . . . . . . . . . . 19 (𝜑 → 𝑁 ∈ ℤ)
8180peano2zd 12845 . . . . . . . . . . . . . . . . . 18 (𝜑 → (𝑁 + 1) ∈ ℤ)
82 fzn 13712 . . . . . . . . . . . . . . . . . 18 (((𝑁 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < (𝑁 + 1) ↔ ((𝑁 + 1)...𝑁) = ∅))
8381, 80, 82syl2anc 596 . . . . . . . . . . . . . . . . 17 (𝜑 → (𝑁 < (𝑁 + 1) ↔ ((𝑁 + 1)...𝑁) = ∅))
8479, 83mpbid 235 . . . . . . . . . . . . . . . 16 (𝜑 → ((𝑁 + 1)...𝑁) = ∅)
8577, 84sylan9eqr 2823 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 𝑗 = 𝑁) → ((𝑗 + 1)...𝑁) = ∅)
8685imaeq2d 6069 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑗 = 𝑁) → ((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) = ((2nd ‘(1st ‘𝑇)) “ ∅))
8786xpeq1d 5686 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑗 = 𝑁) → (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2nd ‘(1st ‘𝑇)) “ ∅) × {0}))
88 ima0 6092 . . . . . . . . . . . . . . 15 ((2nd ‘(1st ‘𝑇)) “ ∅) = ∅
8988xpeq1i 5683 . . . . . . . . . . . . . 14 (((2nd ‘(1st ‘𝑇)) “ ∅) × {0}) = (∅ × {0})
90 0xp 5757 . . . . . . . . . . . . . 14 (∅ × {0}) = ∅
9189, 90eqtri 2789 . . . . . . . . . . . . 13 (((2nd ‘(1st ‘𝑇)) “ ∅) × {0}) = ∅
9287, 91eqtrdi 2817 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑗 = 𝑁) → (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}) = ∅)
9375, 92uneq12d 4170 . . . . . . . . . . 11 ((𝜑 ∧ 𝑗 = 𝑁) → ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})) = (((1...𝑁) × {1}) ∪ ∅))
94 un0 4346 . . . . . . . . . . 11 (((1...𝑁) × {1}) ∪ ∅) = ((1...𝑁) × {1})
9593, 94eqtrdi 2817 . . . . . . . . . 10 ((𝜑 ∧ 𝑗 = 𝑁) → ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((1...𝑁) × {1}))
9695oveq2d 7466 . . . . . . . . 9 ((𝜑 ∧ 𝑗 = 𝑁) → ((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {1})))
973, 96csbied 3886 . . . . . . . 8 (𝜑 → ⦋𝑁 / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {1})))
9897adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑦 = (𝑁 − 1)) → ⦋𝑁 / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {1})))
9962, 98eqtrd 2801 . . . . . 6 ((𝜑 ∧ 𝑦 = (𝑁 − 1)) → ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {1})))
100 ovexd 7485 . . . . . 6 (𝜑 → ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {1})) ∈ V)
10143, 99, 7, 100fvmptd 7031 . . . . 5 (𝜑 → (𝐹‘(𝑁 − 1)) = ((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {1})))
102101fveq1d 6917 . . . 4 (𝜑 → ((𝐹‘(𝑁 − 1))‘𝑛) = (((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {1}))‘𝑛))
103102adantr 486 . . 3 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((𝐹‘(𝑁 − 1))‘𝑛) = (((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {1}))‘𝑛))
104 inidm 4125 . . . 4 ((1...𝑁) ∩ (1...𝑁)) = (1...𝑁)
105 eqidd 2767 . . . 4 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1st ‘(1st ‘𝑇))‘𝑛) = ((1st ‘(1st ‘𝑇))‘𝑛))
10611fvconst2 7240 . . . . 5 (𝑛 ∈ (1...𝑁) → (((1...𝑁) × {1})‘𝑛) = 1)
107106adantl 487 . . . 4 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1...𝑁) × {1})‘𝑛) = 1)
10824, 13, 1, 1, 104, 105, 107ofval 7735 . . 3 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1st ‘(1st ‘𝑇)) ∘f + ((1...𝑁) × {1}))‘𝑛) = (((1st ‘(1st ‘𝑇))‘𝑛) + 1))
109103, 108eqtrd 2801 . 2 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((𝐹‘(𝑁 − 1))‘𝑛) = (((1st ‘(1st ‘𝑇))‘𝑛) + 1))
110 elmapi 8906 . . . . . . 7 ((1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)) → (1st ‘(1st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
11122, 110syl 18 . . . . . 6 (𝜑 → (1st ‘(1st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
112111ffvelcdmda 7115 . . . . 5 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1st ‘(1st ‘𝑇))‘𝑛) ∈ (0..^𝐾))
113 elfzonn0 13881 . . . . 5 (((1st ‘(1st ‘𝑇))‘𝑛) ∈ (0..^𝐾) → ((1st ‘(1st ‘𝑇))‘𝑛) ∈ ℕ0)
114112, 113syl 18 . . . 4 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1st ‘(1st ‘𝑇))‘𝑛) ∈ ℕ0)
115114nn0cnd 12708 . . 3 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1st ‘(1st ‘𝑇))‘𝑛) ∈ ℂ)
116 pncan1 11778 . . 3 (((1st ‘(1st ‘𝑇))‘𝑛) ∈ ℂ → ((((1st ‘(1st ‘𝑇))‘𝑛) + 1) − 1) = ((1st ‘(1st ‘𝑇))‘𝑛))
117115, 116syl 18 . 2 ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((((1st ‘(1st ‘𝑇))‘𝑛) + 1) − 1) = ((1st ‘(1st ‘𝑇))‘𝑛))
1181, 10, 13, 24, 109, 107, 117offveq 7750 1 (𝜑 → ((𝐹‘(𝑁 − 1)) ∘f − ((1...𝑁) × {1})) = (1st ‘(1st ‘𝑇)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ 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  ℂcc 11236  0cc0 11238  1c1 11239   + caddc 11241   < clt 11381   ≤ cle 11382   − cmin 11579  ℕcn 12374  ℕ0cn0 12645  ℤcz 12732  ...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:  poimirlem11  38819  poimirlem13  38821
  Copyright terms: Public domain W3C validator