| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elfzo0 | GIF version | ||
| Description: Membership in a half-open integer range based at 0. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 29-Sep-2015.) |
| Ref | Expression |
|---|---|
| elfzo0 | ⊢ (𝐴 ∈ (0..^𝐵) ↔ (𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ ∧ 𝐴 < 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzouz 10568 | . . . 4 ⊢ (𝐴 ∈ (0..^𝐵) → 𝐴 ∈ (ℤ≥‘0)) | |
| 2 | elnn0uz 9969 | . . . 4 ⊢ (𝐴 ∈ ℕ0 ↔ 𝐴 ∈ (ℤ≥‘0)) | |
| 3 | 1, 2 | sylibr 134 | . . 3 ⊢ (𝐴 ∈ (0..^𝐵) → 𝐴 ∈ ℕ0) |
| 4 | elfzolt3b 10577 | . . . 4 ⊢ (𝐴 ∈ (0..^𝐵) → 0 ∈ (0..^𝐵)) | |
| 5 | lbfzo0 10602 | . . . 4 ⊢ (0 ∈ (0..^𝐵) ↔ 𝐵 ∈ ℕ) | |
| 6 | 4, 5 | sylib 122 | . . 3 ⊢ (𝐴 ∈ (0..^𝐵) → 𝐵 ∈ ℕ) |
| 7 | elfzolt2 10574 | . . 3 ⊢ (𝐴 ∈ (0..^𝐵) → 𝐴 < 𝐵) | |
| 8 | 3, 6, 7 | 3jca 1208 | . 2 ⊢ (𝐴 ∈ (0..^𝐵) → (𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ ∧ 𝐴 < 𝐵)) |
| 9 | simp1 1028 | . . . 4 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℕ0) | |
| 10 | 9, 2 | sylib 122 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ ∧ 𝐴 < 𝐵) → 𝐴 ∈ (ℤ≥‘0)) |
| 11 | nnz 9667 | . . . 4 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
| 12 | 11 | 3ad2ant2 1050 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℤ) |
| 13 | simp3 1030 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵) | |
| 14 | elfzo2 10567 | . . 3 ⊢ (𝐴 ∈ (0..^𝐵) ↔ (𝐴 ∈ (ℤ≥‘0) ∧ 𝐵 ∈ ℤ ∧ 𝐴 < 𝐵)) | |
| 15 | 10, 12, 13, 14 | syl3anbrc 1212 | . 2 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ ∧ 𝐴 < 𝐵) → 𝐴 ∈ (0..^𝐵)) |
| 16 | 8, 15 | impbii 126 | 1 ⊢ (𝐴 ∈ (0..^𝐵) ↔ (𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ ∧ 𝐴 < 𝐵)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ↔ wb 105 ∧ w3a 1009 ∈ wcel 2209 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 0cc0 8179 < clt 8360 ℕcn 9306 ℕ0cn0 9567 ℤcz 9648 ℤ≥cuz 9930 ..^cfzo 10559 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8500 df-neg 8501 df-inn 9307 df-n0 9568 df-z 9649 df-uz 9931 df-fz 10422 df-fzo 10560 |
| This theorem is used by: nn0p1elfzo 10604 fzo1fzo0n0 10605 elfzo0z 10606 elfzo0le 10607 fzonmapblen 10609 fzofzim 10610 ubmelfzo 10628 elfzodifsumelfzo 10629 elfzonlteqm1 10638 fzonn0p1 10639 fzonn0p1p1 10641 elfzom1p1elfzo 10642 ubmelm1fzo 10654 subfzo0 10671 zmodidfzoimp 10804 modfzo0difsn 10845 modsumfzodifsn 10846 addmodlteq 10848 ccatalpha 11395 ccat2s1fvwd 11429 swrdswrd 11491 swrdccatin1 11511 pfxccatin12lem3 11518 addmodlteqALT 12642 hashgcdlem 13036 umgr2cwwkdifex 16764 clwwlknonex2lem2 16777 |
| Copyright terms: Public domain | W3C validator |