Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  madjusmdetlem2 Structured version   Visualization version   GIF version

Theorem madjusmdetlem2 34572
Description: Lemma for madjusmdet 34575. (Contributed by Thierry Arnoux, 26-Aug-2020.)
Hypotheses
Ref Expression
madjusmdet.b 𝐵 = (Base‘𝐴)
madjusmdet.a 𝐴 = ((1...𝑁) Mat 𝑅)
madjusmdet.d 𝐷 = ((1...𝑁) maDet 𝑅)
madjusmdet.k 𝐾 = ((1...𝑁) maAdju 𝑅)
madjusmdet.t · = (.r‘𝑅)
madjusmdet.z 𝑍 = (ℤRHom‘𝑅)
madjusmdet.e 𝐸 = ((1...(𝑁 − 1)) maDet 𝑅)
madjusmdet.n (𝜑 → 𝑁 ∈ ℕ)
madjusmdet.r (𝜑 → 𝑅 ∈ CRing)
madjusmdet.i (𝜑 → 𝐼 ∈ (1...𝑁))
madjusmdet.j (𝜑 → 𝐽 ∈ (1...𝑁))
madjusmdet.m (𝜑 → 𝑀 ∈ 𝐵)
madjusmdetlem2.p 𝑃 = (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖)))
madjusmdetlem2.s 𝑆 = (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝑁, if(𝑖 ≤ 𝑁, (𝑖 − 1), 𝑖)))
Assertion
Ref Expression
madjusmdetlem2 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → if(𝑋 < 𝐼, 𝑋, (𝑋 + 1)) = ((𝑃 ∘ ◡𝑆)‘𝑋))
Distinct variable groups:   𝐵,𝑖   𝑖,𝐼   𝑖,𝐽   𝑖,𝑀   𝑖,𝑁   𝑃,𝑖   𝑅,𝑖   𝜑,𝑖   𝑆,𝑖
Allowed substitution hints:   𝐴(𝑖)   𝐷(𝑖)   · (𝑖)   𝐸(𝑖)   𝐾(𝑖)   𝑋(𝑖)   𝑍(𝑖)

Proof of Theorem madjusmdetlem2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 madjusmdet.n . . . . . . . . . . . 12 (𝜑 → 𝑁 ∈ ℕ)
2 nnuz 13043 . . . . . . . . . . . 12 ℕ = (ℤ≥‘1)
31, 2eleqtrdi 2877 . . . . . . . . . . 11 (𝜑 → 𝑁 ∈ (ℤ≥‘1))
4 eluzfz2 13704 . . . . . . . . . . 11 (𝑁 ∈ (ℤ≥‘1) → 𝑁 ∈ (1...𝑁))
53, 4syl 18 . . . . . . . . . 10 (𝜑 → 𝑁 ∈ (1...𝑁))
6 eqid 2766 . . . . . . . . . . 11 (1...𝑁) = (1...𝑁)
7 madjusmdetlem2.s . . . . . . . . . . 11 𝑆 = (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝑁, if(𝑖 ≤ 𝑁, (𝑖 − 1), 𝑖)))
8 eqid 2766 . . . . . . . . . . 11 (SymGrp‘(1...𝑁)) = (SymGrp‘(1...𝑁))
9 eqid 2766 . . . . . . . . . . 11 (Base‘(SymGrp‘(1...𝑁))) = (Base‘(SymGrp‘(1...𝑁)))
106, 7, 8, 9fzto1st 33764 . . . . . . . . . 10 (𝑁 ∈ (1...𝑁) → 𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))))
115, 10syl 18 . . . . . . . . 9 (𝜑 → 𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))))
128, 9symgbasf1o 19642 . . . . . . . . 9 (𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))) → 𝑆:(1...𝑁)⟶1-1onto(1...𝑁))
1311, 12syl 18 . . . . . . . 8 (𝜑 → 𝑆:(1...𝑁)⟶1-1onto(1...𝑁))
1413adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑆:(1...𝑁)⟶1-1onto(1...𝑁))
15 fznatpl1 13751 . . . . . . . 8 ((𝑁 ∈ ℕ ∧ 𝑋 ∈ (1...(𝑁 − 1))) → (𝑋 + 1) ∈ (1...𝑁))
161, 15sylan 592 . . . . . . 7 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → (𝑋 + 1) ∈ (1...𝑁))
17 eqeq1 2770 . . . . . . . . . . 11 (𝑖 = 𝑥 → (𝑖 = 1 ↔ 𝑥 = 1))
18 breq1 5110 . . . . . . . . . . . 12 (𝑖 = 𝑥 → (𝑖 ≤ 𝑁 ↔ 𝑥 ≤ 𝑁))
19 oveq1 7457 . . . . . . . . . . . 12 (𝑖 = 𝑥 → (𝑖 − 1) = (𝑥 − 1))
20 id 23 . . . . . . . . . . . 12 (𝑖 = 𝑥 → 𝑖 = 𝑥)
2118, 19, 20ifbieq12d 4513 . . . . . . . . . . 11 (𝑖 = 𝑥 → if(𝑖 ≤ 𝑁, (𝑖 − 1), 𝑖) = if(𝑥 ≤ 𝑁, (𝑥 − 1), 𝑥))
2217, 21ifbieq2d 4511 . . . . . . . . . 10 (𝑖 = 𝑥 → if(𝑖 = 1, 𝑁, if(𝑖 ≤ 𝑁, (𝑖 − 1), 𝑖)) = if(𝑥 = 1, 𝑁, if(𝑥 ≤ 𝑁, (𝑥 − 1), 𝑥)))
2322cbvmptv 5214 . . . . . . . . 9 (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝑁, if(𝑖 ≤ 𝑁, (𝑖 − 1), 𝑖))) = (𝑥 ∈ (1...𝑁) ↦ if(𝑥 = 1, 𝑁, if(𝑥 ≤ 𝑁, (𝑥 − 1), 𝑥)))
247, 23eqtri 2789 . . . . . . . 8 𝑆 = (𝑥 ∈ (1...𝑁) ↦ if(𝑥 = 1, 𝑁, if(𝑥 ≤ 𝑁, (𝑥 − 1), 𝑥)))
25 simpr 490 . . . . . . . . . . . 12 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → 𝑥 = (𝑋 + 1))
26 1red 11347 . . . . . . . . . . . . 13 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → 1 ∈ ℝ)
27 fz1ssnn 13728 . . . . . . . . . . . . . . . . 17 (1...(𝑁 − 1)) ⊆ ℕ
28 simpr 490 . . . . . . . . . . . . . . . . 17 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑋 ∈ (1...(𝑁 − 1)))
2927, 28sselid 3910 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑋 ∈ ℕ)
3029nnrpd 13201 . . . . . . . . . . . . . . 15 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑋 ∈ ℝ+)
3130adantr 486 . . . . . . . . . . . . . 14 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → 𝑋 ∈ ℝ+)
3226, 31ltaddrp2d 13237 . . . . . . . . . . . . 13 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → 1 < (𝑋 + 1))
3326, 32gtned 11483 . . . . . . . . . . . 12 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → (𝑋 + 1) ≠ 1)
3425, 33eqnetrd 3029 . . . . . . . . . . 11 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → 𝑥 ≠ 1)
3534neneqd 2967 . . . . . . . . . 10 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → ¬ 𝑥 = 1)
3635iffalsed 4495 . . . . . . . . 9 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 = 1, 𝑁, if(𝑥 ≤ 𝑁, (𝑥 − 1), 𝑥)) = if(𝑥 ≤ 𝑁, (𝑥 − 1), 𝑥))
371adantr 486 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑁 ∈ ℕ)
3829nnnn0d 12706 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑋 ∈ ℕ0)
3937nnnn0d 12706 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑁 ∈ ℕ0)
40 elfzle2 13700 . . . . . . . . . . . . . . 15 (𝑋 ∈ (1...(𝑁 − 1)) → 𝑋 ≤ (𝑁 − 1))
4128, 40syl 18 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑋 ≤ (𝑁 − 1))
42 nn0ltlem1 12798 . . . . . . . . . . . . . . 15 ((𝑋 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑋 < 𝑁 ↔ 𝑋 ≤ (𝑁 − 1)))
4342biimpar 483 . . . . . . . . . . . . . 14 (((𝑋 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) ∧ 𝑋 ≤ (𝑁 − 1)) → 𝑋 < 𝑁)
4438, 39, 41, 43syl21anc 851 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑋 < 𝑁)
45 nnltp1le 12794 . . . . . . . . . . . . . 14 ((𝑋 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑋 < 𝑁 ↔ (𝑋 + 1) ≤ 𝑁))
4645biimpa 482 . . . . . . . . . . . . 13 (((𝑋 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ 𝑋 < 𝑁) → (𝑋 + 1) ≤ 𝑁)
4729, 37, 44, 46syl21anc 851 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → (𝑋 + 1) ≤ 𝑁)
4847adantr 486 . . . . . . . . . . 11 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → (𝑋 + 1) ≤ 𝑁)
4925, 48eqbrtrd 5132 . . . . . . . . . 10 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → 𝑥 ≤ 𝑁)
5049iftrued 4492 . . . . . . . . 9 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 ≤ 𝑁, (𝑥 − 1), 𝑥) = (𝑥 − 1))
5125oveq1d 7465 . . . . . . . . . 10 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → (𝑥 − 1) = ((𝑋 + 1) − 1))
5229nncnd 12390 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑋 ∈ ℂ)
53 1cnd 11340 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 1 ∈ ℂ)
5452, 53pncand 11708 . . . . . . . . . . 11 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → ((𝑋 + 1) − 1) = 𝑋)
5554adantr 486 . . . . . . . . . 10 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → ((𝑋 + 1) − 1) = 𝑋)
5651, 55eqtrd 2801 . . . . . . . . 9 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → (𝑥 − 1) = 𝑋)
5736, 50, 563eqtrd 2805 . . . . . . . 8 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 = 1, 𝑁, if(𝑥 ≤ 𝑁, (𝑥 − 1), 𝑥)) = 𝑋)
5824, 57, 16, 28fvmptd2 7032 . . . . . . 7 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → (𝑆‘(𝑋 + 1)) = 𝑋)
59 f1ocnvfv 7316 . . . . . . . 8 ((𝑆:(1...𝑁)⟶1-1onto(1...𝑁) ∧ (𝑋 + 1) ∈ (1...𝑁)) → ((𝑆‘(𝑋 + 1)) = 𝑋 → (◡𝑆‘𝑋) = (𝑋 + 1)))
6059imp 412 . . . . . . 7 (((𝑆:(1...𝑁)⟶1-1onto(1...𝑁) ∧ (𝑋 + 1) ∈ (1...𝑁)) ∧ (𝑆‘(𝑋 + 1)) = 𝑋) → (◡𝑆‘𝑋) = (𝑋 + 1))
6114, 16, 58, 60syl21anc 851 . . . . . 6 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → (◡𝑆‘𝑋) = (𝑋 + 1))
6261fveq2d 6919 . . . . 5 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → (𝑃‘(◡𝑆‘𝑋)) = (𝑃‘(𝑋 + 1)))
6362adantr 486 . . . 4 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) → (𝑃‘(◡𝑆‘𝑋)) = (𝑃‘(𝑋 + 1)))
64 madjusmdetlem2.p . . . . . 6 𝑃 = (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖)))
65 breq1 5110 . . . . . . . . 9 (𝑖 = 𝑥 → (𝑖 ≤ 𝐼 ↔ 𝑥 ≤ 𝐼))
6665, 19, 20ifbieq12d 4513 . . . . . . . 8 (𝑖 = 𝑥 → if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖) = if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥))
6717, 66ifbieq2d 4511 . . . . . . 7 (𝑖 = 𝑥 → if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖)) = if(𝑥 = 1, 𝐼, if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥)))
6867cbvmptv 5214 . . . . . 6 (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖))) = (𝑥 ∈ (1...𝑁) ↦ if(𝑥 = 1, 𝐼, if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥)))
6964, 68eqtri 2789 . . . . 5 𝑃 = (𝑥 ∈ (1...𝑁) ↦ if(𝑥 = 1, 𝐼, if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥)))
7032, 25breqtrrd 5138 . . . . . . . . . 10 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → 1 < 𝑥)
7126, 70gtned 11483 . . . . . . . . 9 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → 𝑥 ≠ 1)
7271neneqd 2967 . . . . . . . 8 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → ¬ 𝑥 = 1)
7372iffalsed 4495 . . . . . . 7 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 = 1, 𝐼, if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥)) = if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥))
7473adantlr 728 . . . . . 6 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 = 1, 𝐼, if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥)) = if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥))
75 simpr 490 . . . . . . . 8 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → 𝑥 = (𝑋 + 1))
7629ad2antrr 739 . . . . . . . . 9 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → 𝑋 ∈ ℕ)
77 fz1ssnn 13728 . . . . . . . . . . 11 (1...𝑁) ⊆ ℕ
78 madjusmdet.i . . . . . . . . . . 11 (𝜑 → 𝐼 ∈ (1...𝑁))
7977, 78sselid 3910 . . . . . . . . . 10 (𝜑 → 𝐼 ∈ ℕ)
8079ad3antrrr 743 . . . . . . . . 9 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → 𝐼 ∈ ℕ)
81 simplr 781 . . . . . . . . 9 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → 𝑋 < 𝐼)
82 nnltp1le 12794 . . . . . . . . . 10 ((𝑋 ∈ ℕ ∧ 𝐼 ∈ ℕ) → (𝑋 < 𝐼 ↔ (𝑋 + 1) ≤ 𝐼))
8382biimpa 482 . . . . . . . . 9 (((𝑋 ∈ ℕ ∧ 𝐼 ∈ ℕ) ∧ 𝑋 < 𝐼) → (𝑋 + 1) ≤ 𝐼)
8476, 80, 81, 83syl21anc 851 . . . . . . . 8 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → (𝑋 + 1) ≤ 𝐼)
8575, 84eqbrtrd 5132 . . . . . . 7 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → 𝑥 ≤ 𝐼)
8685iftrued 4492 . . . . . 6 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥) = (𝑥 − 1))
8756adantlr 728 . . . . . 6 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → (𝑥 − 1) = 𝑋)
8874, 86, 873eqtrd 2805 . . . . 5 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 = 1, 𝐼, if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥)) = 𝑋)
8916adantr 486 . . . . 5 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) → (𝑋 + 1) ∈ (1...𝑁))
90 simplr 781 . . . . 5 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) → 𝑋 ∈ (1...(𝑁 − 1)))
9169, 88, 89, 90fvmptd2 7032 . . . 4 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) → (𝑃‘(𝑋 + 1)) = 𝑋)
9263, 91eqtr2d 2802 . . 3 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑋 < 𝐼) → 𝑋 = (𝑃‘(◡𝑆‘𝑋)))
9362adantr 486 . . . 4 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ ¬ 𝑋 < 𝐼) → (𝑃‘(◡𝑆‘𝑋)) = (𝑃‘(𝑋 + 1)))
9473adantlr 728 . . . . . 6 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ ¬ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 = 1, 𝐼, if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥)) = if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥))
9529ad2antrr 739 . . . . . . . . . 10 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) ∧ 𝑥 ≤ 𝐼) → 𝑋 ∈ ℕ)
9679ad3antrrr 743 . . . . . . . . . 10 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) ∧ 𝑥 ≤ 𝐼) → 𝐼 ∈ ℕ)
97 simplr 781 . . . . . . . . . . 11 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) ∧ 𝑥 ≤ 𝐼) → 𝑥 = (𝑋 + 1))
98 simpr 490 . . . . . . . . . . 11 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) ∧ 𝑥 ≤ 𝐼) → 𝑥 ≤ 𝐼)
9997, 98eqbrtrrd 5134 . . . . . . . . . 10 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) ∧ 𝑥 ≤ 𝐼) → (𝑋 + 1) ≤ 𝐼)
10082biimpar 483 . . . . . . . . . 10 (((𝑋 ∈ ℕ ∧ 𝐼 ∈ ℕ) ∧ (𝑋 + 1) ≤ 𝐼) → 𝑋 < 𝐼)
10195, 96, 99, 100syl21anc 851 . . . . . . . . 9 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) ∧ 𝑥 ≤ 𝐼) → 𝑋 < 𝐼)
102101stoic1a 1807 . . . . . . . 8 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ 𝑥 = (𝑋 + 1)) ∧ ¬ 𝑋 < 𝐼) → ¬ 𝑥 ≤ 𝐼)
103102an32s 665 . . . . . . 7 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ ¬ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → ¬ 𝑥 ≤ 𝐼)
104103iffalsed 4495 . . . . . 6 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ ¬ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥) = 𝑥)
105 simpr 490 . . . . . 6 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ ¬ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → 𝑥 = (𝑋 + 1))
10694, 104, 1053eqtrd 2805 . . . . 5 ((((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ ¬ 𝑋 < 𝐼) ∧ 𝑥 = (𝑋 + 1)) → if(𝑥 = 1, 𝐼, if(𝑥 ≤ 𝐼, (𝑥 − 1), 𝑥)) = (𝑋 + 1))
10716adantr 486 . . . . 5 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ ¬ 𝑋 < 𝐼) → (𝑋 + 1) ∈ (1...𝑁))
10869, 106, 107, 107fvmptd2 7032 . . . 4 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ ¬ 𝑋 < 𝐼) → (𝑃‘(𝑋 + 1)) = (𝑋 + 1))
10993, 108eqtr2d 2802 . . 3 (((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) ∧ ¬ 𝑋 < 𝐼) → (𝑋 + 1) = (𝑃‘(◡𝑆‘𝑋)))
11092, 109ifeqda 4521 . 2 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → if(𝑋 < 𝐼, 𝑋, (𝑋 + 1)) = (𝑃‘(◡𝑆‘𝑋)))
111 f1ocnv 6866 . . . . 5 (𝑆:(1...𝑁)⟶1-1onto(1...𝑁) → ◡𝑆:(1...𝑁)⟶1-1onto(1...𝑁))
11211, 12, 1113syl 19 . . . 4 (𝜑 → ◡𝑆:(1...𝑁)⟶1-1onto(1...𝑁))
113 f1ofun 6855 . . . 4 (◡𝑆:(1...𝑁)⟶1-1onto(1...𝑁) → Fun ◡𝑆)
114112, 113syl 18 . . 3 (𝜑 → Fun ◡𝑆)
115 fzdif2 33480 . . . . . . 7 (𝑁 ∈ (ℤ≥‘1) → ((1...𝑁) ∖ {𝑁}) = (1...(𝑁 − 1)))
1163, 115syl 18 . . . . . 6 (𝜑 → ((1...𝑁) ∖ {𝑁}) = (1...(𝑁 − 1)))
117 difss 4074 . . . . . 6 ((1...𝑁) ∖ {𝑁}) ⊆ (1...𝑁)
118116, 117eqsstrrdi 3957 . . . . 5 (𝜑 → (1...(𝑁 − 1)) ⊆ (1...𝑁))
119 f1odm 6857 . . . . . 6 (◡𝑆:(1...𝑁)⟶1-1onto(1...𝑁) → dom ◡𝑆 = (1...𝑁))
120112, 119syl 18 . . . . 5 (𝜑 → dom ◡𝑆 = (1...𝑁))
121118, 120sseqtrrd 3949 . . . 4 (𝜑 → (1...(𝑁 − 1)) ⊆ dom ◡𝑆)
122121sselda 3912 . . 3 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → 𝑋 ∈ dom ◡𝑆)
123 fvco 7013 . . 3 ((Fun ◡𝑆 ∧ 𝑋 ∈ dom ◡𝑆) → ((𝑃 ∘ ◡𝑆)‘𝑋) = (𝑃‘(◡𝑆‘𝑋)))
124114, 122, 123syl2an2r 698 . 2 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → ((𝑃 ∘ ◡𝑆)‘𝑋) = (𝑃‘(◡𝑆‘𝑋)))
125110, 124eqtr4d 2804 1 ((𝜑 ∧ 𝑋 ∈ (1...(𝑁 − 1))) → if(𝑋 < 𝐼, 𝑋, (𝑋 + 1)) = ((𝑃 ∘ ◡𝑆)‘𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150   ∖ cdif 4047  ifcif 4484  {csn 4587   class class class wbr 5107   ↦ cmpt 5191  ◡ccnv 5656  dom cdm 5657   ∘ ccom 5661  Fun wfun 6559  ⟶1-1ontowf1o 6564  ‘cfv 6565  (class class class)co 7450  1c1 11239   + caddc 11241   < clt 11381   ≤ cle 11382   − cmin 11579  ℕcn 12374  ℕ0cn0 12645  ℤ≥cuz 13004  ℝ+crp 13159  ...cfz 13678  Basecbs 17433  .rcmulr 17475  SymGrpcsymg 19636  CRingccrg 20513  ℤRHomczrh 21862   Mat cmat 22779   maDet cmdat 22956   maAdju cmadu 23004
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-tp 4592  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-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-2o 8514  df-er 8754  df-map 8886  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  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-2 12444  df-3 12445  df-4 12446  df-5 12447  df-6 12448  df-7 12449  df-8 12450  df-9 12451  df-n0 12646  df-z 12733  df-uz 13005  df-rp 13160  df-fz 13679  df-struct 17371  df-sets 17388  df-slot 17406  df-ndx 17418  df-base 17434  df-ress 17455  df-plusg 17488  df-tset 17494  df-efmnd 19117  df-symg 19637  df-pmtr 19709
This theorem is used by:  madjusmdetlem3  34573
  Copyright terms: Public domain W3C validator