| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > submateqlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for submateq 34144. (Contributed by Thierry Arnoux, 25-Aug-2020.) |
| Ref | Expression |
|---|---|
| submateqlem1.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| submateqlem1.k | ⊢ (𝜑 → 𝐾 ∈ (1...𝑁)) |
| submateqlem1.m | ⊢ (𝜑 → 𝑀 ∈ (1...(𝑁 − 1))) |
| submateqlem1.1 | ⊢ (𝜑 → 𝐾 ≤ 𝑀) |
| Ref | Expression |
|---|---|
| submateqlem1 | ⊢ (𝜑 → (𝑀 ∈ (𝐾...𝑁) ∧ (𝑀 + 1) ∈ ((1...𝑁) ∖ {𝐾}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fz1ssnn 13583 | . . . . 5 ⊢ (1...𝑁) ⊆ ℕ | |
| 2 | submateqlem1.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ (1...𝑁)) | |
| 3 | 1, 2 | sselid 3943 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) |
| 4 | 3 | nnzd 12617 | . . 3 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
| 5 | submateqlem1.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
| 6 | 5 | nnzd 12617 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | fz1ssnn 13583 | . . . . 5 ⊢ (1...(𝑁 − 1)) ⊆ ℕ | |
| 8 | submateqlem1.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ (1...(𝑁 − 1))) | |
| 9 | 7, 8 | sselid 3943 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| 10 | 9 | nnzd 12617 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 11 | submateqlem1.1 | . . 3 ⊢ (𝜑 → 𝐾 ≤ 𝑀) | |
| 12 | 9 | nnred 12248 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 13 | 5 | nnred 12248 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 14 | 1red 11209 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 15 | 13, 14 | resubcld 11642 | . . . 4 ⊢ (𝜑 → (𝑁 − 1) ∈ ℝ) |
| 16 | elfzle2 13556 | . . . . 5 ⊢ (𝑀 ∈ (1...(𝑁 − 1)) → 𝑀 ≤ (𝑁 − 1)) | |
| 17 | 8, 16 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑀 ≤ (𝑁 − 1)) |
| 18 | 13 | lem1d 12148 | . . . 4 ⊢ (𝜑 → (𝑁 − 1) ≤ 𝑁) |
| 19 | 12, 15, 13, 17, 18 | letrd 11367 | . . 3 ⊢ (𝜑 → 𝑀 ≤ 𝑁) |
| 20 | 4, 6, 10, 11, 19 | elfzd 13543 | . 2 ⊢ (𝜑 → 𝑀 ∈ (𝐾...𝑁)) |
| 21 | 1zzd 12625 | . . . 4 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 22 | 10 | peano2zd 12703 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ) |
| 23 | 9 | nnnn0d 12565 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| 24 | 23 | nn0ge0d 12568 | . . . . 5 ⊢ (𝜑 → 0 ≤ 𝑀) |
| 25 | 1re 11208 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 26 | addge02 11725 | . . . . . 6 ⊢ ((1 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (0 ≤ 𝑀 ↔ 1 ≤ (𝑀 + 1))) | |
| 27 | 25, 12, 26 | sylancr 598 | . . . . 5 ⊢ (𝜑 → (0 ≤ 𝑀 ↔ 1 ≤ (𝑀 + 1))) |
| 28 | 24, 27 | mpbid 235 | . . . 4 ⊢ (𝜑 → 1 ≤ (𝑀 + 1)) |
| 29 | 5 | nnnn0d 12565 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| 30 | nn0ltlem1 12656 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) | |
| 31 | 23, 29, 30 | syl2anc 595 | . . . . . 6 ⊢ (𝜑 → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) |
| 32 | 17, 31 | mpbird 260 | . . . . 5 ⊢ (𝜑 → 𝑀 < 𝑁) |
| 33 | nnltp1le 12652 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) | |
| 34 | 9, 5, 33 | syl2anc 595 | . . . . 5 ⊢ (𝜑 → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) |
| 35 | 32, 34 | mpbid 235 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ≤ 𝑁) |
| 36 | 21, 6, 22, 28, 35 | elfzd 13543 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ (1...𝑁)) |
| 37 | 3 | nnred 12248 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℝ) |
| 38 | nnleltp1 12651 | . . . . . . . 8 ⊢ ((𝐾 ∈ ℕ ∧ 𝑀 ∈ ℕ) → (𝐾 ≤ 𝑀 ↔ 𝐾 < (𝑀 + 1))) | |
| 39 | 3, 9, 38 | syl2anc 595 | . . . . . . 7 ⊢ (𝜑 → (𝐾 ≤ 𝑀 ↔ 𝐾 < (𝑀 + 1))) |
| 40 | 11, 39 | mpbid 235 | . . . . . 6 ⊢ (𝜑 → 𝐾 < (𝑀 + 1)) |
| 41 | 37, 40 | ltned 11346 | . . . . 5 ⊢ (𝜑 → 𝐾 ≠ (𝑀 + 1)) |
| 42 | 41 | necomd 3019 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ≠ 𝐾) |
| 43 | nelsn 4637 | . . . 4 ⊢ ((𝑀 + 1) ≠ 𝐾 → ¬ (𝑀 + 1) ∈ {𝐾}) | |
| 44 | 42, 43 | syl 18 | . . 3 ⊢ (𝜑 → ¬ (𝑀 + 1) ∈ {𝐾}) |
| 45 | 36, 44 | eldifd 3924 | . 2 ⊢ (𝜑 → (𝑀 + 1) ∈ ((1...𝑁) ∖ {𝐾})) |
| 46 | 20, 45 | jca 520 | 1 ⊢ (𝜑 → (𝑀 ∈ (𝐾...𝑁) ∧ (𝑀 + 1) ∈ ((1...𝑁) ∖ {𝐾}))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2149 ≠ wne 2964 ∖ cdif 3910 {csn 4594 class class class wbr 5113 (class class class)co 7411 ℝcr 11099 0cc0 11100 1c1 11101 + caddc 11103 < clt 11243 ≤ cle 11244 − cmin 11441 ℕcn 12233 ℕ0cn0 12504 ...cfz 13535 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-n0 12505 df-z 12592 df-uz 12863 df-fz 13536 |
| This theorem is referenced by: submateq 34144 |
| Copyright terms: Public domain | W3C validator |