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 9112 | . . . 4 ⊢ 1 ∈ ℕ0 | |
2 | 3nn0 9114 | . . . 4 ⊢ 3 ∈ ℕ0 | |
3 | 1le3 9050 | . . . 4 ⊢ 1 ≤ 3 | |
4 | elfz2nn0 10021 | . . . 4 ⊢ (1 ∈ (0...3) ↔ (1 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 1 ≤ 3)) | |
5 | 1, 2, 3, 4 | mpbir3an 1164 | . . 3 ⊢ 1 ∈ (0...3) |
6 | fzsplit 9960 | . . 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 9342 | . . . . 5 ⊢ 1 = (0 + 1) | |
9 | 8 | oveq2i 5838 | . . . 4 ⊢ (0...1) = (0...(0 + 1)) |
10 | 0z 9184 | . . . . 5 ⊢ 0 ∈ ℤ | |
11 | fzpr 9986 | . . . . 5 ⊢ (0 ∈ ℤ → (0...(0 + 1)) = {0, (0 + 1)}) | |
12 | 10, 11 | ax-mp 5 | . . . 4 ⊢ (0...(0 + 1)) = {0, (0 + 1)} |
13 | 0p1e1 8953 | . . . . 5 ⊢ (0 + 1) = 1 | |
14 | 13 | preq2i 3642 | . . . 4 ⊢ {0, (0 + 1)} = {0, 1} |
15 | 9, 12, 14 | 3eqtri 2182 | . . 3 ⊢ (0...1) = {0, 1} |
16 | 1p1e2 8956 | . . . . 5 ⊢ (1 + 1) = 2 | |
17 | df-3 8899 | . . . . 5 ⊢ 3 = (2 + 1) | |
18 | 16, 17 | oveq12i 5839 | . . . 4 ⊢ ((1 + 1)...3) = (2...(2 + 1)) |
19 | 2z 9201 | . . . . 5 ⊢ 2 ∈ ℤ | |
20 | fzpr 9986 | . . . . 5 ⊢ (2 ∈ ℤ → (2...(2 + 1)) = {2, (2 + 1)}) | |
21 | 19, 20 | ax-mp 5 | . . . 4 ⊢ (2...(2 + 1)) = {2, (2 + 1)} |
22 | 2p1e3 8972 | . . . . 5 ⊢ (2 + 1) = 3 | |
23 | 22 | preq2i 3642 | . . . 4 ⊢ {2, (2 + 1)} = {2, 3} |
24 | 18, 21, 23 | 3eqtri 2182 | . . 3 ⊢ ((1 + 1)...3) = {2, 3} |
25 | 15, 24 | uneq12i 3260 | . 2 ⊢ ((0...1) ∪ ((1 + 1)...3)) = ({0, 1} ∪ {2, 3}) |
26 | 7, 25 | eqtri 2178 | 1 ⊢ (0...3) = ({0, 1} ∪ {2, 3}) |
Colors of variables: wff set class |
Syntax hints: = wceq 1335 ∈ wcel 2128 ∪ cun 3100 {cpr 3562 class class class wbr 3967 (class class class)co 5827 0cc0 7735 1c1 7736 + caddc 7738 ≤ cle 7916 2c2 8890 3c3 8891 ℕ0cn0 9096 ℤcz 9173 ...cfz 9919 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-sep 4085 ax-pow 4138 ax-pr 4172 ax-un 4396 ax-setind 4499 ax-cnex 7826 ax-resscn 7827 ax-1cn 7828 ax-1re 7829 ax-icn 7830 ax-addcl 7831 ax-addrcl 7832 ax-mulcl 7833 ax-addcom 7835 ax-addass 7837 ax-distr 7839 ax-i2m1 7840 ax-0lt1 7841 ax-0id 7843 ax-rnegex 7844 ax-cnre 7846 ax-pre-ltirr 7847 ax-pre-ltwlin 7848 ax-pre-lttrn 7849 ax-pre-apti 7850 ax-pre-ltadd 7851 |
This theorem depends on definitions: df-bi 116 df-3or 964 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-nel 2423 df-ral 2440 df-rex 2441 df-reu 2442 df-rab 2444 df-v 2714 df-sbc 2938 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-pw 3546 df-sn 3567 df-pr 3568 df-op 3570 df-uni 3775 df-int 3810 df-br 3968 df-opab 4029 df-mpt 4030 df-id 4256 df-xp 4595 df-rel 4596 df-cnv 4597 df-co 4598 df-dm 4599 df-rn 4600 df-res 4601 df-ima 4602 df-iota 5138 df-fun 5175 df-fn 5176 df-f 5177 df-fv 5181 df-riota 5783 df-ov 5830 df-oprab 5831 df-mpo 5832 df-pnf 7917 df-mnf 7918 df-xr 7919 df-ltxr 7920 df-le 7921 df-sub 8053 df-neg 8054 df-inn 8840 df-2 8898 df-3 8899 df-n0 9097 df-z 9174 df-uz 9446 df-fz 9920 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |