| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fz0to3un2pr | GIF version | ||
| Description: An integer range from 0 to 3 is the union of two unordered pairs. (Contributed by AV, 7-Feb-2021.) |
| Ref | Expression |
|---|---|
| fz0to3un2pr | ⊢ (0...3) = ({0, 1} ∪ {2, 3}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1nn0 9396 | . . . 4 ⊢ 1 ∈ ℕ0 | |
| 2 | 3nn0 9398 | . . . 4 ⊢ 3 ∈ ℕ0 | |
| 3 | 1le3 9333 | . . . 4 ⊢ 1 ≤ 3 | |
| 4 | elfz2nn0 10320 | . . . 4 ⊢ (1 ∈ (0...3) ↔ (1 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 1 ≤ 3)) | |
| 5 | 1, 2, 3, 4 | mpbir3an 1203 | . . 3 ⊢ 1 ∈ (0...3) |
| 6 | fzsplit 10259 | . . 3 ⊢ (1 ∈ (0...3) → (0...3) = ((0...1) ∪ ((1 + 1)...3))) | |
| 7 | 5, 6 | ax-mp 5 | . 2 ⊢ (0...3) = ((0...1) ∪ ((1 + 1)...3)) |
| 8 | 1e0p1 9630 | . . . . 5 ⊢ 1 = (0 + 1) | |
| 9 | 8 | oveq2i 6018 | . . . 4 ⊢ (0...1) = (0...(0 + 1)) |
| 10 | 0z 9468 | . . . . 5 ⊢ 0 ∈ ℤ | |
| 11 | fzpr 10285 | . . . . 5 ⊢ (0 ∈ ℤ → (0...(0 + 1)) = {0, (0 + 1)}) | |
| 12 | 10, 11 | ax-mp 5 | . . . 4 ⊢ (0...(0 + 1)) = {0, (0 + 1)} |
| 13 | 0p1e1 9235 | . . . . 5 ⊢ (0 + 1) = 1 | |
| 14 | 13 | preq2i 3747 | . . . 4 ⊢ {0, (0 + 1)} = {0, 1} |
| 15 | 9, 12, 14 | 3eqtri 2254 | . . 3 ⊢ (0...1) = {0, 1} |
| 16 | 1p1e2 9238 | . . . . 5 ⊢ (1 + 1) = 2 | |
| 17 | df-3 9181 | . . . . 5 ⊢ 3 = (2 + 1) | |
| 18 | 16, 17 | oveq12i 6019 | . . . 4 ⊢ ((1 + 1)...3) = (2...(2 + 1)) |
| 19 | 2z 9485 | . . . . 5 ⊢ 2 ∈ ℤ | |
| 20 | fzpr 10285 | . . . . 5 ⊢ (2 ∈ ℤ → (2...(2 + 1)) = {2, (2 + 1)}) | |
| 21 | 19, 20 | ax-mp 5 | . . . 4 ⊢ (2...(2 + 1)) = {2, (2 + 1)} |
| 22 | 2p1e3 9255 | . . . . 5 ⊢ (2 + 1) = 3 | |
| 23 | 22 | preq2i 3747 | . . . 4 ⊢ {2, (2 + 1)} = {2, 3} |
| 24 | 18, 21, 23 | 3eqtri 2254 | . . 3 ⊢ ((1 + 1)...3) = {2, 3} |
| 25 | 15, 24 | uneq12i 3356 | . 2 ⊢ ((0...1) ∪ ((1 + 1)...3)) = ({0, 1} ∪ {2, 3}) |
| 26 | 7, 25 | eqtri 2250 | 1 ⊢ (0...3) = ({0, 1} ∪ {2, 3}) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1395 ∈ wcel 2200 ∪ cun 3195 {cpr 3667 class class class wbr 4083 (class class class)co 6007 0cc0 8010 1c1 8011 + caddc 8013 ≤ cle 8193 2c2 9172 3c3 9173 ℕ0cn0 9380 ℤcz 9457 ...cfz 10216 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-addass 8112 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-0id 8118 ax-rnegex 8119 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-inn 9122 df-2 9180 df-3 9181 df-n0 9381 df-z 9458 df-uz 9734 df-fz 10217 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |