![]() |
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 9256 | . . . 4 ⊢ 1 ∈ ℕ0 | |
2 | 3nn0 9258 | . . . 4 ⊢ 3 ∈ ℕ0 | |
3 | 1le3 9193 | . . . 4 ⊢ 1 ≤ 3 | |
4 | elfz2nn0 10178 | . . . 4 ⊢ (1 ∈ (0...3) ↔ (1 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 1 ≤ 3)) | |
5 | 1, 2, 3, 4 | mpbir3an 1181 | . . 3 ⊢ 1 ∈ (0...3) |
6 | fzsplit 10117 | . . 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 9489 | . . . . 5 ⊢ 1 = (0 + 1) | |
9 | 8 | oveq2i 5929 | . . . 4 ⊢ (0...1) = (0...(0 + 1)) |
10 | 0z 9328 | . . . . 5 ⊢ 0 ∈ ℤ | |
11 | fzpr 10143 | . . . . 5 ⊢ (0 ∈ ℤ → (0...(0 + 1)) = {0, (0 + 1)}) | |
12 | 10, 11 | ax-mp 5 | . . . 4 ⊢ (0...(0 + 1)) = {0, (0 + 1)} |
13 | 0p1e1 9096 | . . . . 5 ⊢ (0 + 1) = 1 | |
14 | 13 | preq2i 3699 | . . . 4 ⊢ {0, (0 + 1)} = {0, 1} |
15 | 9, 12, 14 | 3eqtri 2218 | . . 3 ⊢ (0...1) = {0, 1} |
16 | 1p1e2 9099 | . . . . 5 ⊢ (1 + 1) = 2 | |
17 | df-3 9042 | . . . . 5 ⊢ 3 = (2 + 1) | |
18 | 16, 17 | oveq12i 5930 | . . . 4 ⊢ ((1 + 1)...3) = (2...(2 + 1)) |
19 | 2z 9345 | . . . . 5 ⊢ 2 ∈ ℤ | |
20 | fzpr 10143 | . . . . 5 ⊢ (2 ∈ ℤ → (2...(2 + 1)) = {2, (2 + 1)}) | |
21 | 19, 20 | ax-mp 5 | . . . 4 ⊢ (2...(2 + 1)) = {2, (2 + 1)} |
22 | 2p1e3 9115 | . . . . 5 ⊢ (2 + 1) = 3 | |
23 | 22 | preq2i 3699 | . . . 4 ⊢ {2, (2 + 1)} = {2, 3} |
24 | 18, 21, 23 | 3eqtri 2218 | . . 3 ⊢ ((1 + 1)...3) = {2, 3} |
25 | 15, 24 | uneq12i 3311 | . 2 ⊢ ((0...1) ∪ ((1 + 1)...3)) = ({0, 1} ∪ {2, 3}) |
26 | 7, 25 | eqtri 2214 | 1 ⊢ (0...3) = ({0, 1} ∪ {2, 3}) |
Colors of variables: wff set class |
Syntax hints: = wceq 1364 ∈ wcel 2164 ∪ cun 3151 {cpr 3619 class class class wbr 4029 (class class class)co 5918 0cc0 7872 1c1 7873 + caddc 7875 ≤ cle 8055 2c2 9033 3c3 9034 ℕ0cn0 9240 ℤcz 9317 ...cfz 10074 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 |
This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-inn 8983 df-2 9041 df-3 9042 df-n0 9241 df-z 9318 df-uz 9593 df-fz 10075 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |