![]() |
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 11901 | . . . 4 ⊢ 1 ∈ ℕ0 | |
2 | 3nn0 11903 | . . . 4 ⊢ 3 ∈ ℕ0 | |
3 | 1le3 11837 | . . . 4 ⊢ 1 ≤ 3 | |
4 | elfz2nn0 12993 | . . . 4 ⊢ (1 ∈ (0...3) ↔ (1 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 1 ≤ 3)) | |
5 | 1, 2, 3, 4 | mpbir3an 1338 | . . 3 ⊢ 1 ∈ (0...3) |
6 | fzsplit 12928 | . . 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 12128 | . . . . 5 ⊢ 1 = (0 + 1) | |
9 | 8 | oveq2i 7146 | . . . 4 ⊢ (0...1) = (0...(0 + 1)) |
10 | 0z 11980 | . . . . 5 ⊢ 0 ∈ ℤ | |
11 | fzpr 12957 | . . . . 5 ⊢ (0 ∈ ℤ → (0...(0 + 1)) = {0, (0 + 1)}) | |
12 | 10, 11 | ax-mp 5 | . . . 4 ⊢ (0...(0 + 1)) = {0, (0 + 1)} |
13 | 0p1e1 11747 | . . . . 5 ⊢ (0 + 1) = 1 | |
14 | 13 | preq2i 4633 | . . . 4 ⊢ {0, (0 + 1)} = {0, 1} |
15 | 9, 12, 14 | 3eqtri 2825 | . . 3 ⊢ (0...1) = {0, 1} |
16 | 1p1e2 11750 | . . . . 5 ⊢ (1 + 1) = 2 | |
17 | df-3 11689 | . . . . 5 ⊢ 3 = (2 + 1) | |
18 | 16, 17 | oveq12i 7147 | . . . 4 ⊢ ((1 + 1)...3) = (2...(2 + 1)) |
19 | 2z 12002 | . . . . 5 ⊢ 2 ∈ ℤ | |
20 | fzpr 12957 | . . . . 5 ⊢ (2 ∈ ℤ → (2...(2 + 1)) = {2, (2 + 1)}) | |
21 | 19, 20 | ax-mp 5 | . . . 4 ⊢ (2...(2 + 1)) = {2, (2 + 1)} |
22 | 2p1e3 11767 | . . . . 5 ⊢ (2 + 1) = 3 | |
23 | 22 | preq2i 4633 | . . . 4 ⊢ {2, (2 + 1)} = {2, 3} |
24 | 18, 21, 23 | 3eqtri 2825 | . . 3 ⊢ ((1 + 1)...3) = {2, 3} |
25 | 15, 24 | uneq12i 4088 | . 2 ⊢ ((0...1) ∪ ((1 + 1)...3)) = ({0, 1} ∪ {2, 3}) |
26 | 7, 25 | eqtri 2821 | 1 ⊢ (0...3) = ({0, 1} ∪ {2, 3}) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∈ wcel 2111 ∪ cun 3879 {cpr 4527 class class class wbr 5030 (class class class)co 7135 0cc0 10526 1c1 10527 + caddc 10529 ≤ cle 10665 2c2 11680 3c3 11681 ℕ0cn0 11885 ℤcz 11969 ...cfz 12885 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 |
This theorem is referenced by: iblcnlem1 24391 3wlkdlem4 27947 |
Copyright terms: Public domain | W3C validator |