Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elfz1b | Structured version Visualization version GIF version |
Description: Membership in a 1-based finite set of sequential integers. (Contributed by AV, 30-Oct-2018.) (Proof shortened by AV, 23-Jan-2022.) |
Ref | Expression |
---|---|
elfz1b | ⊢ (𝑁 ∈ (1...𝑀) ↔ (𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ ∧ 𝑁 ≤ 𝑀)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfz2 13102 | . . . 4 ⊢ (𝑁 ∈ (1...𝑀) ↔ ((1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 ≤ 𝑁 ∧ 𝑁 ≤ 𝑀))) | |
2 | simpl2 1194 | . . . . 5 ⊢ (((1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 ≤ 𝑁 ∧ 𝑁 ≤ 𝑀)) → 𝑀 ∈ ℤ) | |
3 | 1red 10834 | . . . . . . 7 ⊢ ((1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 1 ∈ ℝ) | |
4 | zre 12180 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
5 | 4 | 3ad2ant3 1137 | . . . . . . 7 ⊢ ((1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℝ) |
6 | zre 12180 | . . . . . . . 8 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
7 | 6 | 3ad2ant2 1136 | . . . . . . 7 ⊢ ((1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℝ) |
8 | letr 10926 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑀 ∈ ℝ) → ((1 ≤ 𝑁 ∧ 𝑁 ≤ 𝑀) → 1 ≤ 𝑀)) | |
9 | 3, 5, 7, 8 | syl3anc 1373 | . . . . . 6 ⊢ ((1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((1 ≤ 𝑁 ∧ 𝑁 ≤ 𝑀) → 1 ≤ 𝑀)) |
10 | 9 | imp 410 | . . . . 5 ⊢ (((1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 ≤ 𝑁 ∧ 𝑁 ≤ 𝑀)) → 1 ≤ 𝑀) |
11 | elnnz1 12203 | . . . . 5 ⊢ (𝑀 ∈ ℕ ↔ (𝑀 ∈ ℤ ∧ 1 ≤ 𝑀)) | |
12 | 2, 10, 11 | sylanbrc 586 | . . . 4 ⊢ (((1 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 ≤ 𝑁 ∧ 𝑁 ≤ 𝑀)) → 𝑀 ∈ ℕ) |
13 | 1, 12 | sylbi 220 | . . 3 ⊢ (𝑁 ∈ (1...𝑀) → 𝑀 ∈ ℕ) |
14 | elfzel2 13110 | . . . 4 ⊢ (𝑁 ∈ (1...𝑀) → 𝑀 ∈ ℤ) | |
15 | fznn 13180 | . . . . 5 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (1...𝑀) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≤ 𝑀))) | |
16 | 15 | biimpd 232 | . . . 4 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (1...𝑀) → (𝑁 ∈ ℕ ∧ 𝑁 ≤ 𝑀))) |
17 | 14, 16 | mpcom 38 | . . 3 ⊢ (𝑁 ∈ (1...𝑀) → (𝑁 ∈ ℕ ∧ 𝑁 ≤ 𝑀)) |
18 | 3anan12 1098 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ ∧ 𝑁 ≤ 𝑀) ↔ (𝑀 ∈ ℕ ∧ (𝑁 ∈ ℕ ∧ 𝑁 ≤ 𝑀))) | |
19 | 13, 17, 18 | sylanbrc 586 | . 2 ⊢ (𝑁 ∈ (1...𝑀) → (𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ ∧ 𝑁 ≤ 𝑀)) |
20 | nnz 12199 | . . . . . 6 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℤ) | |
21 | 20, 15 | syl 17 | . . . . 5 ⊢ (𝑀 ∈ ℕ → (𝑁 ∈ (1...𝑀) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≤ 𝑀))) |
22 | 21 | biimprd 251 | . . . 4 ⊢ (𝑀 ∈ ℕ → ((𝑁 ∈ ℕ ∧ 𝑁 ≤ 𝑀) → 𝑁 ∈ (1...𝑀))) |
23 | 22 | expd 419 | . . 3 ⊢ (𝑀 ∈ ℕ → (𝑁 ∈ ℕ → (𝑁 ≤ 𝑀 → 𝑁 ∈ (1...𝑀)))) |
24 | 23 | 3imp21 1116 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ ∧ 𝑁 ≤ 𝑀) → 𝑁 ∈ (1...𝑀)) |
25 | 19, 24 | impbii 212 | 1 ⊢ (𝑁 ∈ (1...𝑀) ↔ (𝑁 ∈ ℕ ∧ 𝑀 ∈ ℕ ∧ 𝑁 ≤ 𝑀)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1089 ∈ wcel 2110 class class class wbr 5053 (class class class)co 7213 ℝcr 10728 1c1 10730 ≤ cle 10868 ℕcn 11830 ℤcz 12176 ...cfz 13095 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-om 7645 df-1st 7761 df-2nd 7762 df-wrecs 8047 df-recs 8108 df-rdg 8146 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-nn 11831 df-z 12177 df-uz 12439 df-fz 13096 |
This theorem is referenced by: ubmelfzo 13307 cshwidxm 14373 cshwidxn 14374 gausslemma2dlem1a 26246 gausslemma2dlem2 26248 gausslemma2dlem4 26250 dlwwlknondlwlknonf1olem1 28447 pmtrto1cl 31085 psgnfzto1stlem 31086 fzto1st 31089 psgnfzto1st 31091 hgt750lemb 32348 poimirlem32 35546 |
Copyright terms: Public domain | W3C validator |