![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > uzm1 | GIF version |
Description: Choices for an element of an upper interval of integers. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Ref | Expression |
---|---|
uzm1 | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 = 𝑀 ∨ (𝑁 − 1) ∈ (ℤ≥‘𝑀))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluzle 8261 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝑁) | |
2 | eluzel2 8254 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
3 | 2 | zred 8136 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℝ) |
4 | eluzelz 8258 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
5 | 4 | zred 8136 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℝ) |
6 | 3, 5 | lenltd 6931 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀)) |
7 | 1, 6 | mpbid 135 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ¬ 𝑁 < 𝑀) |
8 | ztri3or 8064 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ∨ 𝑀 = 𝑁 ∨ 𝑁 < 𝑀)) | |
9 | 2, 4, 8 | syl2anc 391 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 < 𝑁 ∨ 𝑀 = 𝑁 ∨ 𝑁 < 𝑀)) |
10 | df-3or 885 | . . . . 5 ⊢ ((𝑀 < 𝑁 ∨ 𝑀 = 𝑁 ∨ 𝑁 < 𝑀) ↔ ((𝑀 < 𝑁 ∨ 𝑀 = 𝑁) ∨ 𝑁 < 𝑀)) | |
11 | 9, 10 | sylib 127 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑀 < 𝑁 ∨ 𝑀 = 𝑁) ∨ 𝑁 < 𝑀)) |
12 | 7, 11 | ecased 1238 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 < 𝑁 ∨ 𝑀 = 𝑁)) |
13 | 12 | orcomd 647 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 = 𝑁 ∨ 𝑀 < 𝑁)) |
14 | eqcom 2039 | . . . . 5 ⊢ (𝑀 = 𝑁 ↔ 𝑁 = 𝑀) | |
15 | 14 | biimpi 113 | . . . 4 ⊢ (𝑀 = 𝑁 → 𝑁 = 𝑀) |
16 | 15 | a1i 9 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 = 𝑁 → 𝑁 = 𝑀)) |
17 | zltlem1 8077 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) | |
18 | 2, 4, 17 | syl2anc 391 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) |
19 | 1zzd 8048 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 1 ∈ ℤ) | |
20 | 4, 19 | zsubcld 8141 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 − 1) ∈ ℤ) |
21 | eluz 8262 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) → ((𝑁 − 1) ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ (𝑁 − 1))) | |
22 | 2, 20, 21 | syl2anc 391 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 − 1) ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ (𝑁 − 1))) |
23 | 18, 22 | bitr4d 180 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 < 𝑁 ↔ (𝑁 − 1) ∈ (ℤ≥‘𝑀))) |
24 | 23 | biimpd 132 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀 < 𝑁 → (𝑁 − 1) ∈ (ℤ≥‘𝑀))) |
25 | 16, 24 | orim12d 699 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑀 = 𝑁 ∨ 𝑀 < 𝑁) → (𝑁 = 𝑀 ∨ (𝑁 − 1) ∈ (ℤ≥‘𝑀)))) |
26 | 13, 25 | mpd 13 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 = 𝑀 ∨ (𝑁 − 1) ∈ (ℤ≥‘𝑀))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 98 ∨ wo 628 ∨ w3o 883 = wceq 1242 ∈ wcel 1390 class class class wbr 3755 ‘cfv 4845 (class class class)co 5455 1c1 6712 < clt 6857 ≤ cle 6858 − cmin 6979 ℤcz 8021 ℤ≥cuz 8249 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 629 ax-5 1333 ax-7 1334 ax-gen 1335 ax-ie1 1379 ax-ie2 1380 ax-8 1392 ax-10 1393 ax-11 1394 ax-i12 1395 ax-bndl 1396 ax-4 1397 ax-13 1401 ax-14 1402 ax-17 1416 ax-i9 1420 ax-ial 1424 ax-i5r 1425 ax-ext 2019 ax-coll 3863 ax-sep 3866 ax-nul 3874 ax-pow 3918 ax-pr 3935 ax-un 4136 ax-setind 4220 ax-iinf 4254 ax-cnex 6774 ax-resscn 6775 ax-1cn 6776 ax-1re 6777 ax-icn 6778 ax-addcl 6779 ax-addrcl 6780 ax-mulcl 6781 ax-addcom 6783 ax-addass 6785 ax-distr 6787 ax-i2m1 6788 ax-0id 6791 ax-rnegex 6792 ax-cnre 6794 ax-pre-ltirr 6795 ax-pre-ltwlin 6796 ax-pre-lttrn 6797 ax-pre-ltadd 6799 |
This theorem depends on definitions: df-bi 110 df-dc 742 df-3or 885 df-3an 886 df-tru 1245 df-fal 1248 df-nf 1347 df-sb 1643 df-eu 1900 df-mo 1901 df-clab 2024 df-cleq 2030 df-clel 2033 df-nfc 2164 df-ne 2203 df-nel 2204 df-ral 2305 df-rex 2306 df-reu 2307 df-rab 2309 df-v 2553 df-sbc 2759 df-csb 2847 df-dif 2914 df-un 2916 df-in 2918 df-ss 2925 df-nul 3219 df-pw 3353 df-sn 3373 df-pr 3374 df-op 3376 df-uni 3572 df-int 3607 df-iun 3650 df-br 3756 df-opab 3810 df-mpt 3811 df-tr 3846 df-eprel 4017 df-id 4021 df-po 4024 df-iso 4025 df-iord 4069 df-on 4071 df-suc 4074 df-iom 4257 df-xp 4294 df-rel 4295 df-cnv 4296 df-co 4297 df-dm 4298 df-rn 4299 df-res 4300 df-ima 4301 df-iota 4810 df-fun 4847 df-fn 4848 df-f 4849 df-f1 4850 df-fo 4851 df-f1o 4852 df-fv 4853 df-riota 5411 df-ov 5458 df-oprab 5459 df-mpt2 5460 df-1st 5709 df-2nd 5710 df-recs 5861 df-irdg 5897 df-1o 5940 df-2o 5941 df-oadd 5944 df-omul 5945 df-er 6042 df-ec 6044 df-qs 6048 df-ni 6288 df-pli 6289 df-mi 6290 df-lti 6291 df-plpq 6328 df-mpq 6329 df-enq 6331 df-nqqs 6332 df-plqqs 6333 df-mqqs 6334 df-1nqqs 6335 df-rq 6336 df-ltnqqs 6337 df-enq0 6407 df-nq0 6408 df-0nq0 6409 df-plq0 6410 df-mq0 6411 df-inp 6449 df-i1p 6450 df-iplp 6451 df-iltp 6453 df-enr 6654 df-nr 6655 df-ltr 6658 df-0r 6659 df-1r 6660 df-0 6718 df-1 6719 df-r 6721 df-lt 6724 df-pnf 6859 df-mnf 6860 df-xr 6861 df-ltxr 6862 df-le 6863 df-sub 6981 df-neg 6982 df-inn 7696 df-n0 7958 df-z 8022 df-uz 8250 |
This theorem is referenced by: uzp1 8282 fzm1 8732 |
Copyright terms: Public domain | W3C validator |