Theorem fz0to4untppr 10531

Description: An integer range from 0 to 4 is the union of a triple and a pair. (Contributed by Alexander van der Vekens, 13-Aug-2017.)

Assertion

Ref	Expression
fz0to4untppr	⊢ (0...4) = ({0, 1, 2} ∪ {3, 4})

Proof of Theorem fz0to4untppr

Step	Hyp	Ref	Expression
1		df-3 9364	. . . . 5 ⊢ 3 = (2 + 1)
2		2cn 9375	. . . . . . . 8 ⊢ 2 ∈ ℂ
3	2	addlidi 8469	. . . . . . 7 ⊢ (0 + 2) = 2
4	3	eqcomi 2242	. . . . . 6 ⊢ 2 = (0 + 2)
5	4	oveq1i 6095	. . . . 5 ⊢ (2 + 1) = ((0 + 2) + 1)
6	1, 5	eqtri 2259	. . . 4 ⊢ 3 = ((0 + 2) + 1)
7		3z 9673	. . . . 5 ⊢ 3 ∈ ℤ
8		0re 8326	. . . . . 6 ⊢ 0 ∈ ℝ
9		3re 9378	. . . . . 6 ⊢ 3 ∈ ℝ
10		3pos 9398	. . . . . 6 ⊢ 0 < 3
11	8, 9, 10	ltleii 8428	. . . . 5 ⊢ 0 ≤ 3
12		0z 9655	. . . . . 6 ⊢ 0 ∈ ℤ
13	12	eluz1i 9929	. . . . 5 ⊢ (3 ∈ (ℤ≥‘0) ↔ (3 ∈ ℤ ∧ 0 ≤ 3))
14	7, 11, 13	mpbir2an 955	. . . 4 ⊢ 3 ∈ (ℤ≥‘0)
15	6, 14	eqeltrri 2312	. . 3 ⊢ ((0 + 2) + 1) ∈ (ℤ≥‘0)
16		4z 9674	. . . . 5 ⊢ 4 ∈ ℤ
17		2re 9374	. . . . . 6 ⊢ 2 ∈ ℝ
18		4re 9381	. . . . . 6 ⊢ 4 ∈ ℝ
19		2lt4 9478	. . . . . 6 ⊢ 2 < 4
20	17, 18, 19	ltleii 8428	. . . . 5 ⊢ 2 ≤ 4
21		2z 9672	. . . . . 6 ⊢ 2 ∈ ℤ
22	21	eluz1i 9929	. . . . 5 ⊢ (4 ∈ (ℤ≥‘2) ↔ (4 ∈ ℤ ∧ 2 ≤ 4))
23	16, 20, 22	mpbir2an 955	. . . 4 ⊢ 4 ∈ (ℤ≥‘2)
24	4	fveq2i 5698	. . . 4 ⊢ (ℤ≥‘2) = (ℤ≥‘(0 + 2))
25	23, 24	eleqtri 2313	. . 3 ⊢ 4 ∈ (ℤ≥‘(0 + 2))
26		fzsplit2 10455	. . 3 ⊢ ((((0 + 2) + 1) ∈ (ℤ≥‘0) ∧ 4 ∈ (ℤ≥‘(0 + 2))) → (0...4) = ((0...(0 + 2)) ∪ (((0 + 2) + 1)...4)))
27	15, 25, 26	mp2an 430	. 2 ⊢ (0...4) = ((0...(0 + 2)) ∪ (((0 + 2) + 1)...4))
28		fztp 10485	. . . . 5 ⊢ (0 ∈ ℤ → (0...(0 + 2)) = {0, (0 + 1), (0 + 2)})
29	12, 28	ax-mp 5	. . . 4 ⊢ (0...(0 + 2)) = {0, (0 + 1), (0 + 2)}
30		ax-1cn 8272	. . . . 5 ⊢ 1 ∈ ℂ
31		eqidd 2239	. . . . . 6 ⊢ (1 ∈ ℂ → 0 = 0)
32		addlid 8465	. . . . . 6 ⊢ (1 ∈ ℂ → (0 + 1) = 1)
33	3	a1i 9	. . . . . 6 ⊢ (1 ∈ ℂ → (0 + 2) = 2)
34	31, 32, 33	tpeq123d 3803	. . . . 5 ⊢ (1 ∈ ℂ → {0, (0 + 1), (0 + 2)} = {0, 1, 2})
35	30, 34	ax-mp 5	. . . 4 ⊢ {0, (0 + 1), (0 + 2)} = {0, 1, 2}
36	29, 35	eqtri 2259	. . 3 ⊢ (0...(0 + 2)) = {0, 1, 2}
37	3	a1i 9	. . . . . . . 8 ⊢ (3 ∈ ℤ → (0 + 2) = 2)
38	37	oveq1d 6100	. . . . . . 7 ⊢ (3 ∈ ℤ → ((0 + 2) + 1) = (2 + 1))
39	38, 1	eqtr4di 2289	. . . . . 6 ⊢ (3 ∈ ℤ → ((0 + 2) + 1) = 3)
40	39	oveq1d 6100	. . . . 5 ⊢ (3 ∈ ℤ → (((0 + 2) + 1)...4) = (3...4))
41		eqid 2238	. . . . . . . . . 10 ⊢ 3 = 3
42		df-4 9365	. . . . . . . . . 10 ⊢ 4 = (3 + 1)
43	41, 42	pm3.2i 272	. . . . . . . . 9 ⊢ (3 = 3 ∧ 4 = (3 + 1))
44	43	a1i 9	. . . . . . . 8 ⊢ (3 ∈ ℤ → (3 = 3 ∧ 4 = (3 + 1)))
45		3lt4 9477	. . . . . . . . . . 11 ⊢ 3 < 4
46	9, 18, 45	ltleii 8428	. . . . . . . . . 10 ⊢ 3 ≤ 4
47	7	eluz1i 9929	. . . . . . . . . 10 ⊢ (4 ∈ (ℤ≥‘3) ↔ (4 ∈ ℤ ∧ 3 ≤ 4))
48	16, 46, 47	mpbir2an 955	. . . . . . . . 9 ⊢ 4 ∈ (ℤ≥‘3)
49		fzopth 10467	. . . . . . . . 9 ⊢ (4 ∈ (ℤ≥‘3) → ((3...4) = (3...(3 + 1)) ↔ (3 = 3 ∧ 4 = (3 + 1))))
50	48, 49	ax-mp 5	. . . . . . . 8 ⊢ ((3...4) = (3...(3 + 1)) ↔ (3 = 3 ∧ 4 = (3 + 1)))
51	44, 50	sylibr 134	. . . . . . 7 ⊢ (3 ∈ ℤ → (3...4) = (3...(3 + 1)))
52		fzpr 10484	. . . . . . 7 ⊢ (3 ∈ ℤ → (3...(3 + 1)) = {3, (3 + 1)})
53	51, 52	eqtrd 2271	. . . . . 6 ⊢ (3 ∈ ℤ → (3...4) = {3, (3 + 1)})
54	42	eqcomi 2242	. . . . . . 7 ⊢ (3 + 1) = 4
55	54	preq2i 3792	. . . . . 6 ⊢ {3, (3 + 1)} = {3, 4}
56	53, 55	eqtrdi 2287	. . . . 5 ⊢ (3 ∈ ℤ → (3...4) = {3, 4})
57	40, 56	eqtrd 2271	. . . 4 ⊢ (3 ∈ ℤ → (((0 + 2) + 1)...4) = {3, 4})
58	7, 57	ax-mp 5	. . 3 ⊢ (((0 + 2) + 1)...4) = {3, 4}
59	36, 58	uneq12i 3381	. 2 ⊢ ((0...(0 + 2)) ∪ (((0 + 2) + 1)...4)) = ({0, 1, 2} ∪ {3, 4})
60	27, 59	eqtri 2259	1 ⊢ (0...4) = ({0, 1, 2} ∪ {3, 4})

This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209   ∪ cun 3218  {cpr 3710  {ctp 3711   class class class wbr 4130  ‘cfv 5377  (class class class)co 6085  ℂcc 8177  0cc0 8179  1c1 8180   + caddc 8182   ≤ cle 8361  2c2 9355  3c3 9356  4c4 9357  ℤcz 9644  ℤ_≥cuz 9921  ...cfz 10411

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-tp 3717  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412

This theorem is used by:  prm23lt5  13042