![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > submateqlem2 | Structured version Visualization version GIF version |
Description: Lemma for submateq 31162. (Contributed by Thierry Arnoux, 26-Aug-2020.) |
Ref | Expression |
---|---|
submateqlem2.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
submateqlem2.k | ⊢ (𝜑 → 𝐾 ∈ (1...𝑁)) |
submateqlem2.m | ⊢ (𝜑 → 𝑀 ∈ (1...(𝑁 − 1))) |
submateqlem2.1 | ⊢ (𝜑 → 𝑀 < 𝐾) |
Ref | Expression |
---|---|
submateqlem2 | ⊢ (𝜑 → (𝑀 ∈ (1..^𝐾) ∧ 𝑀 ∈ ((1...𝑁) ∖ {𝐾}))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fz1ssnn 12933 | . . . . . 6 ⊢ (1...(𝑁 − 1)) ⊆ ℕ | |
2 | submateqlem2.m | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (1...(𝑁 − 1))) | |
3 | 1, 2 | sseldi 3913 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
4 | 3 | nnge1d 11673 | . . . 4 ⊢ (𝜑 → 1 ≤ 𝑀) |
5 | submateqlem2.1 | . . . 4 ⊢ (𝜑 → 𝑀 < 𝐾) | |
6 | 4, 5 | jca 515 | . . 3 ⊢ (𝜑 → (1 ≤ 𝑀 ∧ 𝑀 < 𝐾)) |
7 | 3 | nnzd 12074 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
8 | 1zzd 12001 | . . . 4 ⊢ (𝜑 → 1 ∈ ℤ) | |
9 | fz1ssnn 12933 | . . . . . 6 ⊢ (1...𝑁) ⊆ ℕ | |
10 | submateqlem2.k | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (1...𝑁)) | |
11 | 9, 10 | sseldi 3913 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℕ) |
12 | 11 | nnzd 12074 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
13 | elfzo 13035 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 1 ∈ ℤ ∧ 𝐾 ∈ ℤ) → (𝑀 ∈ (1..^𝐾) ↔ (1 ≤ 𝑀 ∧ 𝑀 < 𝐾))) | |
14 | 7, 8, 12, 13 | syl3anc 1368 | . . 3 ⊢ (𝜑 → (𝑀 ∈ (1..^𝐾) ↔ (1 ≤ 𝑀 ∧ 𝑀 < 𝐾))) |
15 | 6, 14 | mpbird 260 | . 2 ⊢ (𝜑 → 𝑀 ∈ (1..^𝐾)) |
16 | 2 | orcd 870 | . . . 4 ⊢ (𝜑 → (𝑀 ∈ (1...(𝑁 − 1)) ∨ 𝑀 = 𝑁)) |
17 | submateqlem2.n | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
18 | nnuz 12269 | . . . . . 6 ⊢ ℕ = (ℤ≥‘1) | |
19 | 17, 18 | eleqtrdi 2900 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘1)) |
20 | fzm1 12982 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘1) → (𝑀 ∈ (1...𝑁) ↔ (𝑀 ∈ (1...(𝑁 − 1)) ∨ 𝑀 = 𝑁))) | |
21 | 19, 20 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑀 ∈ (1...𝑁) ↔ (𝑀 ∈ (1...(𝑁 − 1)) ∨ 𝑀 = 𝑁))) |
22 | 16, 21 | mpbird 260 | . . 3 ⊢ (𝜑 → 𝑀 ∈ (1...𝑁)) |
23 | 3 | nnred 11640 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
24 | 23, 5 | ltned 10765 | . . . 4 ⊢ (𝜑 → 𝑀 ≠ 𝐾) |
25 | nelsn 4565 | . . . 4 ⊢ (𝑀 ≠ 𝐾 → ¬ 𝑀 ∈ {𝐾}) | |
26 | 24, 25 | syl 17 | . . 3 ⊢ (𝜑 → ¬ 𝑀 ∈ {𝐾}) |
27 | 22, 26 | eldifd 3892 | . 2 ⊢ (𝜑 → 𝑀 ∈ ((1...𝑁) ∖ {𝐾})) |
28 | 15, 27 | jca 515 | 1 ⊢ (𝜑 → (𝑀 ∈ (1..^𝐾) ∧ 𝑀 ∈ ((1...𝑁) ∖ {𝐾}))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∖ cdif 3878 {csn 4525 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 1c1 10527 < clt 10664 ≤ cle 10665 − cmin 10859 ℕcn 11625 ℤcz 11969 ℤ≥cuz 12231 ...cfz 12885 ..^cfzo 13028 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 |
This theorem is referenced by: submateq 31162 |
Copyright terms: Public domain | W3C validator |