| 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 33772. (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 13492 | . . . . 5 ⊢ (1...𝑁) ⊆ ℕ | |
| 2 | submateqlem1.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ (1...𝑁)) | |
| 3 | 1, 2 | sselid 3941 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) |
| 4 | 3 | nnzd 12532 | . . 3 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
| 5 | submateqlem1.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
| 6 | 5 | nnzd 12532 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | fz1ssnn 13492 | . . . . 5 ⊢ (1...(𝑁 − 1)) ⊆ ℕ | |
| 8 | submateqlem1.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ (1...(𝑁 − 1))) | |
| 9 | 7, 8 | sselid 3941 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| 10 | 9 | nnzd 12532 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 11 | submateqlem1.1 | . . 3 ⊢ (𝜑 → 𝐾 ≤ 𝑀) | |
| 12 | 9 | nnred 12177 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 13 | 5 | nnred 12177 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 14 | 1red 11151 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 15 | 13, 14 | resubcld 11582 | . . . 4 ⊢ (𝜑 → (𝑁 − 1) ∈ ℝ) |
| 16 | elfzle2 13465 | . . . . 5 ⊢ (𝑀 ∈ (1...(𝑁 − 1)) → 𝑀 ≤ (𝑁 − 1)) | |
| 17 | 8, 16 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑀 ≤ (𝑁 − 1)) |
| 18 | 13 | lem1d 12092 | . . . 4 ⊢ (𝜑 → (𝑁 − 1) ≤ 𝑁) |
| 19 | 12, 15, 13, 17, 18 | letrd 11307 | . . 3 ⊢ (𝜑 → 𝑀 ≤ 𝑁) |
| 20 | 4, 6, 10, 11, 19 | elfzd 13452 | . 2 ⊢ (𝜑 → 𝑀 ∈ (𝐾...𝑁)) |
| 21 | 1zzd 12540 | . . . 4 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 22 | 10 | peano2zd 12617 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ) |
| 23 | 9 | nnnn0d 12479 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| 24 | 23 | nn0ge0d 12482 | . . . . 5 ⊢ (𝜑 → 0 ≤ 𝑀) |
| 25 | 1re 11150 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 26 | addge02 11665 | . . . . . 6 ⊢ ((1 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (0 ≤ 𝑀 ↔ 1 ≤ (𝑀 + 1))) | |
| 27 | 25, 12, 26 | sylancr 587 | . . . . 5 ⊢ (𝜑 → (0 ≤ 𝑀 ↔ 1 ≤ (𝑀 + 1))) |
| 28 | 24, 27 | mpbid 232 | . . . 4 ⊢ (𝜑 → 1 ≤ (𝑀 + 1)) |
| 29 | 5 | nnnn0d 12479 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| 30 | nn0ltlem1 12570 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) | |
| 31 | 23, 29, 30 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) |
| 32 | 17, 31 | mpbird 257 | . . . . 5 ⊢ (𝜑 → 𝑀 < 𝑁) |
| 33 | nnltp1le 12566 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) | |
| 34 | 9, 5, 33 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) |
| 35 | 32, 34 | mpbid 232 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ≤ 𝑁) |
| 36 | 21, 6, 22, 28, 35 | elfzd 13452 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ (1...𝑁)) |
| 37 | 3 | nnred 12177 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℝ) |
| 38 | nnleltp1 12565 | . . . . . . . 8 ⊢ ((𝐾 ∈ ℕ ∧ 𝑀 ∈ ℕ) → (𝐾 ≤ 𝑀 ↔ 𝐾 < (𝑀 + 1))) | |
| 39 | 3, 9, 38 | syl2anc 584 | . . . . . . 7 ⊢ (𝜑 → (𝐾 ≤ 𝑀 ↔ 𝐾 < (𝑀 + 1))) |
| 40 | 11, 39 | mpbid 232 | . . . . . 6 ⊢ (𝜑 → 𝐾 < (𝑀 + 1)) |
| 41 | 37, 40 | ltned 11286 | . . . . 5 ⊢ (𝜑 → 𝐾 ≠ (𝑀 + 1)) |
| 42 | 41 | necomd 2980 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ≠ 𝐾) |
| 43 | nelsn 4626 | . . . 4 ⊢ ((𝑀 + 1) ≠ 𝐾 → ¬ (𝑀 + 1) ∈ {𝐾}) | |
| 44 | 42, 43 | syl 17 | . . 3 ⊢ (𝜑 → ¬ (𝑀 + 1) ∈ {𝐾}) |
| 45 | 36, 44 | eldifd 3922 | . 2 ⊢ (𝜑 → (𝑀 + 1) ∈ ((1...𝑁) ∖ {𝐾})) |
| 46 | 20, 45 | jca 511 | 1 ⊢ (𝜑 → (𝑀 ∈ (𝐾...𝑁) ∧ (𝑀 + 1) ∈ ((1...𝑁) ∖ {𝐾}))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2109 ≠ wne 2925 ∖ cdif 3908 {csn 4585 class class class wbr 5102 (class class class)co 7369 ℝcr 11043 0cc0 11044 1c1 11045 + caddc 11047 < clt 11184 ≤ cle 11185 − cmin 11381 ℕcn 12162 ℕ0cn0 12418 ...cfz 13444 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-n0 12419 df-z 12506 df-uz 12770 df-fz 13445 |
| This theorem is referenced by: submateq 33772 |
| Copyright terms: Public domain | W3C validator |