Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fz0to3un2pr | Structured version Visualization version 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 11912 | . . . 4 ⊢ 1 ∈ ℕ0 | |
2 | 3nn0 11914 | . . . 4 ⊢ 3 ∈ ℕ0 | |
3 | 1le3 11848 | . . . 4 ⊢ 1 ≤ 3 | |
4 | elfz2nn0 12997 | . . . 4 ⊢ (1 ∈ (0...3) ↔ (1 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 1 ≤ 3)) | |
5 | 1, 2, 3, 4 | mpbir3an 1337 | . . 3 ⊢ 1 ∈ (0...3) |
6 | fzsplit 12932 | . . 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 12139 | . . . . 5 ⊢ 1 = (0 + 1) | |
9 | 8 | oveq2i 7166 | . . . 4 ⊢ (0...1) = (0...(0 + 1)) |
10 | 0z 11991 | . . . . 5 ⊢ 0 ∈ ℤ | |
11 | fzpr 12961 | . . . . 5 ⊢ (0 ∈ ℤ → (0...(0 + 1)) = {0, (0 + 1)}) | |
12 | 10, 11 | ax-mp 5 | . . . 4 ⊢ (0...(0 + 1)) = {0, (0 + 1)} |
13 | 0p1e1 11758 | . . . . 5 ⊢ (0 + 1) = 1 | |
14 | 13 | preq2i 4672 | . . . 4 ⊢ {0, (0 + 1)} = {0, 1} |
15 | 9, 12, 14 | 3eqtri 2848 | . . 3 ⊢ (0...1) = {0, 1} |
16 | 1p1e2 11761 | . . . . 5 ⊢ (1 + 1) = 2 | |
17 | df-3 11700 | . . . . 5 ⊢ 3 = (2 + 1) | |
18 | 16, 17 | oveq12i 7167 | . . . 4 ⊢ ((1 + 1)...3) = (2...(2 + 1)) |
19 | 2z 12013 | . . . . 5 ⊢ 2 ∈ ℤ | |
20 | fzpr 12961 | . . . . 5 ⊢ (2 ∈ ℤ → (2...(2 + 1)) = {2, (2 + 1)}) | |
21 | 19, 20 | ax-mp 5 | . . . 4 ⊢ (2...(2 + 1)) = {2, (2 + 1)} |
22 | 2p1e3 11778 | . . . . 5 ⊢ (2 + 1) = 3 | |
23 | 22 | preq2i 4672 | . . . 4 ⊢ {2, (2 + 1)} = {2, 3} |
24 | 18, 21, 23 | 3eqtri 2848 | . . 3 ⊢ ((1 + 1)...3) = {2, 3} |
25 | 15, 24 | uneq12i 4136 | . 2 ⊢ ((0...1) ∪ ((1 + 1)...3)) = ({0, 1} ∪ {2, 3}) |
26 | 7, 25 | eqtri 2844 | 1 ⊢ (0...3) = ({0, 1} ∪ {2, 3}) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∈ wcel 2110 ∪ cun 3933 {cpr 4568 class class class wbr 5065 (class class class)co 7155 0cc0 10536 1c1 10537 + caddc 10539 ≤ cle 10675 2c2 11691 3c3 11692 ℕ0cn0 11896 ℤcz 11980 ...cfz 12891 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-2 11699 df-3 11700 df-n0 11897 df-z 11981 df-uz 12243 df-fz 12892 |
This theorem is referenced by: iblcnlem1 24387 3wlkdlem4 27940 |
Copyright terms: Public domain | W3C validator |