| 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 34265. (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 13602 | . . . . 5 ⊢ (1...𝑁) ⊆ ℕ | |
| 2 | submateqlem1.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ (1...𝑁)) | |
| 3 | 1, 2 | sselid 3936 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ) |
| 4 | 3 | nnzd 12634 | . . 3 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
| 5 | submateqlem1.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
| 6 | 5 | nnzd 12634 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | fz1ssnn 13602 | . . . . 5 ⊢ (1...(𝑁 − 1)) ⊆ ℕ | |
| 8 | submateqlem1.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ (1...(𝑁 − 1))) | |
| 9 | 7, 8 | sselid 3936 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| 10 | 9 | nnzd 12634 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 11 | submateqlem1.1 | . . 3 ⊢ (𝜑 → 𝐾 ≤ 𝑀) | |
| 12 | 9 | nnred 12265 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 13 | 5 | nnred 12265 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 14 | 1red 11226 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 15 | 13, 14 | resubcld 11659 | . . . 4 ⊢ (𝜑 → (𝑁 − 1) ∈ ℝ) |
| 16 | elfzle2 13574 | . . . . 5 ⊢ (𝑀 ∈ (1...(𝑁 − 1)) → 𝑀 ≤ (𝑁 − 1)) | |
| 17 | 8, 16 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑀 ≤ (𝑁 − 1)) |
| 18 | 13 | lem1d 12165 | . . . 4 ⊢ (𝜑 → (𝑁 − 1) ≤ 𝑁) |
| 19 | 12, 15, 13, 17, 18 | letrd 11384 | . . 3 ⊢ (𝜑 → 𝑀 ≤ 𝑁) |
| 20 | 4, 6, 10, 11, 19 | elfzd 13561 | . 2 ⊢ (𝜑 → 𝑀 ∈ (𝐾...𝑁)) |
| 21 | 1zzd 12642 | . . . 4 ⊢ (𝜑 → 1 ∈ ℤ) | |
| 22 | 10 | peano2zd 12721 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ) |
| 23 | 9 | nnnn0d 12582 | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| 24 | 23 | nn0ge0d 12585 | . . . . 5 ⊢ (𝜑 → 0 ≤ 𝑀) |
| 25 | 1re 11225 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 26 | addge02 11742 | . . . . . 6 ⊢ ((1 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (0 ≤ 𝑀 ↔ 1 ≤ (𝑀 + 1))) | |
| 27 | 25, 12, 26 | sylancr 599 | . . . . 5 ⊢ (𝜑 → (0 ≤ 𝑀 ↔ 1 ≤ (𝑀 + 1))) |
| 28 | 24, 27 | mpbid 235 | . . . 4 ⊢ (𝜑 → 1 ≤ (𝑀 + 1)) |
| 29 | 5 | nnnn0d 12582 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| 30 | nn0ltlem1 12674 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) | |
| 31 | 23, 29, 30 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) |
| 32 | 17, 31 | mpbird 260 | . . . . 5 ⊢ (𝜑 → 𝑀 < 𝑁) |
| 33 | nnltp1le 12670 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) | |
| 34 | 9, 5, 33 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) |
| 35 | 32, 34 | mpbid 235 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ≤ 𝑁) |
| 36 | 21, 6, 22, 28, 35 | elfzd 13561 | . . 3 ⊢ (𝜑 → (𝑀 + 1) ∈ (1...𝑁)) |
| 37 | 3 | nnred 12265 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℝ) |
| 38 | nnleltp1 12669 | . . . . . . . 8 ⊢ ((𝐾 ∈ ℕ ∧ 𝑀 ∈ ℕ) → (𝐾 ≤ 𝑀 ↔ 𝐾 < (𝑀 + 1))) | |
| 39 | 3, 9, 38 | syl2anc 596 | . . . . . . 7 ⊢ (𝜑 → (𝐾 ≤ 𝑀 ↔ 𝐾 < (𝑀 + 1))) |
| 40 | 11, 39 | mpbid 235 | . . . . . 6 ⊢ (𝜑 → 𝐾 < (𝑀 + 1)) |
| 41 | 37, 40 | ltned 11363 | . . . . 5 ⊢ (𝜑 → 𝐾 ≠ (𝑀 + 1)) |
| 42 | 41 | necomd 3015 | . . . 4 ⊢ (𝜑 → (𝑀 + 1) ≠ 𝐾) |
| 43 | nelsn 4634 | . . . 4 ⊢ ((𝑀 + 1) ≠ 𝐾 → ¬ (𝑀 + 1) ∈ {𝐾}) | |
| 44 | 42, 43 | syl 18 | . . 3 ⊢ (𝜑 → ¬ (𝑀 + 1) ∈ {𝐾}) |
| 45 | 36, 44 | eldifd 3917 | . 2 ⊢ (𝜑 → (𝑀 + 1) ∈ ((1...𝑁) ∖ {𝐾})) |
| 46 | 20, 45 | jca 521 | 1 ⊢ (𝜑 → (𝑀 ∈ (𝐾...𝑁) ∧ (𝑀 + 1) ∈ ((1...𝑁) ∖ {𝐾}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2146 ≠ wne 2960 ∖ cdif 3903 {csn 4591 class class class wbr 5111 (class class class)co 7419 ℝcr 11116 0cc0 11117 1c1 11118 + caddc 11120 < clt 11260 ≤ cle 11261 − cmin 11458 ℕcn 12250 ℕ0cn0 12521 ...cfz 13553 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-n0 12522 df-z 12609 df-uz 12881 df-fz 13554 |
| This theorem is used by: submateq 34265 |
| Copyright terms: Public domain | W3C validator |