| 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 34199. (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 13579 | . . . . 5 ⊢ (1...𝑁) ⊆ ℕ | |
| 2 | submateqlem1.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ (1...𝑁)) | |
| 3 | 1, 2 | sselid 3935 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) |
| 4 | 3 | nnzd 12612 | . . 3 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
| 5 | submateqlem1.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
| 6 | 5 | nnzd 12612 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | fz1ssnn 13579 | . . . . 5 ⊢ (1...(𝑁 − 1)) ⊆ ℕ | |
| 8 | submateqlem1.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ (1...(𝑁 − 1))) | |
| 9 | 7, 8 | sselid 3935 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| 10 | 9 | nnzd 12612 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 11 | submateqlem1.1 | . . 3 ⊢ (𝜑 → 𝐾 ≤ 𝑀) | |
| 12 | 9 | nnred 12243 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 13 | 5 | nnred 12243 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 14 | 1red 11204 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 15 | 13, 14 | resubcld 11637 | . . . 4 ⊢ (𝜑 → (𝑁 − 1) ∈ ℝ) |
| 16 | elfzle2 13551 | . . . . 5 ⊢ (𝑀 ∈ (1...(𝑁 − 1)) → 𝑀 ≤ (𝑁 − 1)) | |
| 17 | 8, 16 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑀 ≤ (𝑁 − 1)) |
| 18 | 13 | lem1d 12143 | . . . 4 ⊢ (𝜑 → (𝑁 − 1) ≤ 𝑁) |
| 19 | 12, 15, 13, 17, 18 | letrd 11362 | . . 3 ⊢ (𝜑 → 𝑀 ≤ 𝑁) |
| 20 | 4, 6, 10, 11, 19 | elfzd 13538 | . 2 ⊢ (𝜑 → 𝑀 ∈ (𝐾...𝑁)) |
| 21 | 1zzd 12620 | . . . 4 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 22 | 10 | peano2zd 12698 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ) |
| 23 | 9 | nnnn0d 12560 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| 24 | 23 | nn0ge0d 12563 | . . . . 5 ⊢ (𝜑 → 0 ≤ 𝑀) |
| 25 | 1re 11203 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 26 | addge02 11720 | . . . . . 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 12560 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| 30 | nn0ltlem1 12651 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) | |
| 31 | 23, 29, 30 | syl2anc 595 | . . . . . 6 ⊢ (𝜑 → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) |
| 32 | 17, 31 | mpbird 260 | . . . . 5 ⊢ (𝜑 → 𝑀 < 𝑁) |
| 33 | nnltp1le 12647 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) | |
| 34 | 9, 5, 33 | syl2anc 595 | . . . . 5 ⊢ (𝜑 → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) |
| 35 | 32, 34 | mpbid 235 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ≤ 𝑁) |
| 36 | 21, 6, 22, 28, 35 | elfzd 13538 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ (1...𝑁)) |
| 37 | 3 | nnred 12243 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℝ) |
| 38 | nnleltp1 12646 | . . . . . . . 8 ⊢ ((𝐾 ∈ ℕ ∧ 𝑀 ∈ ℕ) → (𝐾 ≤ 𝑀 ↔ 𝐾 < (𝑀 + 1))) | |
| 39 | 3, 9, 38 | syl2anc 595 | . . . . . . 7 ⊢ (𝜑 → (𝐾 ≤ 𝑀 ↔ 𝐾 < (𝑀 + 1))) |
| 40 | 11, 39 | mpbid 235 | . . . . . 6 ⊢ (𝜑 → 𝐾 < (𝑀 + 1)) |
| 41 | 37, 40 | ltned 11341 | . . . . 5 ⊢ (𝜑 → 𝐾 ≠ (𝑀 + 1)) |
| 42 | 41 | necomd 3013 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ≠ 𝐾) |
| 43 | nelsn 4632 | . . . 4 ⊢ ((𝑀 + 1) ≠ 𝐾 → ¬ (𝑀 + 1) ∈ {𝐾}) | |
| 44 | 42, 43 | syl 18 | . . 3 ⊢ (𝜑 → ¬ (𝑀 + 1) ∈ {𝐾}) |
| 45 | 36, 44 | eldifd 3916 | . 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 2143 ≠ wne 2958 ∖ cdif 3902 {csn 4589 class class class wbr 5109 (class class class)co 7410 ℝcr 11094 0cc0 11095 1c1 11096 + caddc 11098 < clt 11238 ≤ cle 11239 − cmin 11436 ℕcn 12228 ℕ0cn0 12499 ...cfz 13530 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-n0 12500 df-z 12587 df-uz 12858 df-fz 13531 |
| This theorem is referenced by: submateq 34199 |
| Copyright terms: Public domain | W3C validator |