Theorem uzrest 23285

Description: The restriction of the set of upper sets of integers to an upper set of integers is the set of upper sets of integers based at a point above the cutoff. (Contributed by Mario Carneiro, 13-Oct-2015.)

Hypothesis

Ref	Expression
uzfbas.1	⊢ 𝑍 = (ℤ≥‘𝑀)

Assertion

Ref	Expression
uzrest	⊢ (𝑀 ∈ ℤ → (ran ℤ≥ ↾t 𝑍) = (ℤ≥ “ 𝑍))

Proof of Theorem uzrest

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		zex 12517	. . . . . 6 ⊢ ℤ ∈ V
2	1	pwex 5340	. . . . 5 ⊢ 𝒫 ℤ ∈ V
3		uzf 12775	. . . . . 6 ⊢ ℤ≥:ℤ⟶𝒫 ℤ
4		frn 6680	. . . . . 6 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → ran ℤ≥ ⊆ 𝒫 ℤ)
5	3, 4	ax-mp 5	. . . . 5 ⊢ ran ℤ≥ ⊆ 𝒫 ℤ
6	2, 5	ssexi 5284	. . . 4 ⊢ ran ℤ≥ ∈ V
7		uzfbas.1	. . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀)
8	7	fvexi 6861	. . . 4 ⊢ 𝑍 ∈ V
9		restval 17322	. . . 4 ⊢ ((ran ℤ≥ ∈ V ∧ 𝑍 ∈ V) → (ran ℤ≥ ↾t 𝑍) = ran (𝑥 ∈ ran ℤ≥ ↦ (𝑥 ∩ 𝑍)))
10	6, 8, 9	mp2an 690	. . 3 ⊢ (ran ℤ≥ ↾t 𝑍) = ran (𝑥 ∈ ran ℤ≥ ↦ (𝑥 ∩ 𝑍))
11	7	ineq2i 4174	. . . . . . . . 9 ⊢ ((ℤ≥‘𝑦) ∩ 𝑍) = ((ℤ≥‘𝑦) ∩ (ℤ≥‘𝑀))
12		uzin 12812	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((ℤ≥‘𝑦) ∩ (ℤ≥‘𝑀)) = (ℤ≥‘if(𝑦 ≤ 𝑀, 𝑀, 𝑦)))
13	12	ancoms 459	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((ℤ≥‘𝑦) ∩ (ℤ≥‘𝑀)) = (ℤ≥‘if(𝑦 ≤ 𝑀, 𝑀, 𝑦)))
14	11, 13	eqtrid 2783	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((ℤ≥‘𝑦) ∩ 𝑍) = (ℤ≥‘if(𝑦 ≤ 𝑀, 𝑀, 𝑦)))
15		ffn 6673	. . . . . . . . . 10 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → ℤ≥ Fn ℤ)
16	3, 15	ax-mp 5	. . . . . . . . 9 ⊢ ℤ≥ Fn ℤ
17		uzssz 12793	. . . . . . . . . 10 ⊢ (ℤ≥‘𝑀) ⊆ ℤ
18	7, 17	eqsstri 3981	. . . . . . . . 9 ⊢ 𝑍 ⊆ ℤ
19		ifcl 4536	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ ℤ) → if(𝑦 ≤ 𝑀, 𝑀, 𝑦) ∈ ℤ)
20		uzid 12787	. . . . . . . . . . . 12 ⊢ (if(𝑦 ≤ 𝑀, 𝑀, 𝑦) ∈ ℤ → if(𝑦 ≤ 𝑀, 𝑀, 𝑦) ∈ (ℤ≥‘if(𝑦 ≤ 𝑀, 𝑀, 𝑦)))
21	19, 20	syl 17	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ ℤ) → if(𝑦 ≤ 𝑀, 𝑀, 𝑦) ∈ (ℤ≥‘if(𝑦 ≤ 𝑀, 𝑀, 𝑦)))
22	21, 14	eleqtrrd 2835	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ ℤ) → if(𝑦 ≤ 𝑀, 𝑀, 𝑦) ∈ ((ℤ≥‘𝑦) ∩ 𝑍))
23	22	elin2d 4164	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ ℤ) → if(𝑦 ≤ 𝑀, 𝑀, 𝑦) ∈ 𝑍)
24		fnfvima 7188	. . . . . . . . 9 ⊢ ((ℤ≥ Fn ℤ ∧ 𝑍 ⊆ ℤ ∧ if(𝑦 ≤ 𝑀, 𝑀, 𝑦) ∈ 𝑍) → (ℤ≥‘if(𝑦 ≤ 𝑀, 𝑀, 𝑦)) ∈ (ℤ≥ “ 𝑍))
25	16, 18, 23, 24	mp3an12i 1465	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (ℤ≥‘if(𝑦 ≤ 𝑀, 𝑀, 𝑦)) ∈ (ℤ≥ “ 𝑍))
26	14, 25	eqeltrd 2832	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((ℤ≥‘𝑦) ∩ 𝑍) ∈ (ℤ≥ “ 𝑍))
27	26	ralrimiva 3139	. . . . . 6 ⊢ (𝑀 ∈ ℤ → ∀𝑦 ∈ ℤ ((ℤ≥‘𝑦) ∩ 𝑍) ∈ (ℤ≥ “ 𝑍))
28		ineq1 4170	. . . . . . . . 9 ⊢ (𝑥 = (ℤ≥‘𝑦) → (𝑥 ∩ 𝑍) = ((ℤ≥‘𝑦) ∩ 𝑍))
29	28	eleq1d 2817	. . . . . . . 8 ⊢ (𝑥 = (ℤ≥‘𝑦) → ((𝑥 ∩ 𝑍) ∈ (ℤ≥ “ 𝑍) ↔ ((ℤ≥‘𝑦) ∩ 𝑍) ∈ (ℤ≥ “ 𝑍)))
30	29	ralrn 7043	. . . . . . 7 ⊢ (ℤ≥ Fn ℤ → (∀𝑥 ∈ ran ℤ≥(𝑥 ∩ 𝑍) ∈ (ℤ≥ “ 𝑍) ↔ ∀𝑦 ∈ ℤ ((ℤ≥‘𝑦) ∩ 𝑍) ∈ (ℤ≥ “ 𝑍)))
31	16, 30	ax-mp 5	. . . . . 6 ⊢ (∀𝑥 ∈ ran ℤ≥(𝑥 ∩ 𝑍) ∈ (ℤ≥ “ 𝑍) ↔ ∀𝑦 ∈ ℤ ((ℤ≥‘𝑦) ∩ 𝑍) ∈ (ℤ≥ “ 𝑍))
32	27, 31	sylibr 233	. . . . 5 ⊢ (𝑀 ∈ ℤ → ∀𝑥 ∈ ran ℤ≥(𝑥 ∩ 𝑍) ∈ (ℤ≥ “ 𝑍))
33		eqid 2731	. . . . . 6 ⊢ (𝑥 ∈ ran ℤ≥ ↦ (𝑥 ∩ 𝑍)) = (𝑥 ∈ ran ℤ≥ ↦ (𝑥 ∩ 𝑍))
34	33	fmpt 7063	. . . . 5 ⊢ (∀𝑥 ∈ ran ℤ≥(𝑥 ∩ 𝑍) ∈ (ℤ≥ “ 𝑍) ↔ (𝑥 ∈ ran ℤ≥ ↦ (𝑥 ∩ 𝑍)):ran ℤ≥⟶(ℤ≥ “ 𝑍))
35	32, 34	sylib 217	. . . 4 ⊢ (𝑀 ∈ ℤ → (𝑥 ∈ ran ℤ≥ ↦ (𝑥 ∩ 𝑍)):ran ℤ≥⟶(ℤ≥ “ 𝑍))
36	35	frnd 6681	. . 3 ⊢ (𝑀 ∈ ℤ → ran (𝑥 ∈ ran ℤ≥ ↦ (𝑥 ∩ 𝑍)) ⊆ (ℤ≥ “ 𝑍))
37	10, 36	eqsstrid 3995	. 2 ⊢ (𝑀 ∈ ℤ → (ran ℤ≥ ↾t 𝑍) ⊆ (ℤ≥ “ 𝑍))
38	7	uztrn2 12791	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑍 ∧ 𝑦 ∈ (ℤ≥‘𝑥)) → 𝑦 ∈ 𝑍)
39	38	ex 413	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑍 → (𝑦 ∈ (ℤ≥‘𝑥) → 𝑦 ∈ 𝑍))
40	39	ssrdv 3953	. . . . . . 7 ⊢ (𝑥 ∈ 𝑍 → (ℤ≥‘𝑥) ⊆ 𝑍)
41	40	adantl 482	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝑍) → (ℤ≥‘𝑥) ⊆ 𝑍)
42		df-ss 3930	. . . . . 6 ⊢ ((ℤ≥‘𝑥) ⊆ 𝑍 ↔ ((ℤ≥‘𝑥) ∩ 𝑍) = (ℤ≥‘𝑥))
43	41, 42	sylib 217	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝑍) → ((ℤ≥‘𝑥) ∩ 𝑍) = (ℤ≥‘𝑥))
44	18	sseli 3943	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑍 → 𝑥 ∈ ℤ)
45	44	adantl 482	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝑍) → 𝑥 ∈ ℤ)
46		fnfvelrn 7036	. . . . . . 7 ⊢ ((ℤ≥ Fn ℤ ∧ 𝑥 ∈ ℤ) → (ℤ≥‘𝑥) ∈ ran ℤ≥)
47	16, 45, 46	sylancr 587	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝑍) → (ℤ≥‘𝑥) ∈ ran ℤ≥)
48		elrestr 17324	. . . . . 6 ⊢ ((ran ℤ≥ ∈ V ∧ 𝑍 ∈ V ∧ (ℤ≥‘𝑥) ∈ ran ℤ≥) → ((ℤ≥‘𝑥) ∩ 𝑍) ∈ (ran ℤ≥ ↾t 𝑍))
49	6, 8, 47, 48	mp3an12i 1465	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝑍) → ((ℤ≥‘𝑥) ∩ 𝑍) ∈ (ran ℤ≥ ↾t 𝑍))
50	43, 49	eqeltrrd 2833	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ 𝑍) → (ℤ≥‘𝑥) ∈ (ran ℤ≥ ↾t 𝑍))
51	50	ralrimiva 3139	. . 3 ⊢ (𝑀 ∈ ℤ → ∀𝑥 ∈ 𝑍 (ℤ≥‘𝑥) ∈ (ran ℤ≥ ↾t 𝑍))
52		ffun 6676	. . . . 5 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → Fun ℤ≥)
53	3, 52	ax-mp 5	. . . 4 ⊢ Fun ℤ≥
54	3	fdmi 6685	. . . . 5 ⊢ dom ℤ≥ = ℤ
55	18, 54	sseqtrri 3984	. . . 4 ⊢ 𝑍 ⊆ dom ℤ≥
56		funimass4 6912	. . . 4 ⊢ ((Fun ℤ≥ ∧ 𝑍 ⊆ dom ℤ≥) → ((ℤ≥ “ 𝑍) ⊆ (ran ℤ≥ ↾t 𝑍) ↔ ∀𝑥 ∈ 𝑍 (ℤ≥‘𝑥) ∈ (ran ℤ≥ ↾t 𝑍)))
57	53, 55, 56	mp2an 690	. . 3 ⊢ ((ℤ≥ “ 𝑍) ⊆ (ran ℤ≥ ↾t 𝑍) ↔ ∀𝑥 ∈ 𝑍 (ℤ≥‘𝑥) ∈ (ran ℤ≥ ↾t 𝑍))
58	51, 57	sylibr 233	. 2 ⊢ (𝑀 ∈ ℤ → (ℤ≥ “ 𝑍) ⊆ (ran ℤ≥ ↾t 𝑍))
59	37, 58	eqssd 3964	1 ⊢ (𝑀 ∈ ℤ → (ran ℤ≥ ↾t 𝑍) = (ℤ≥ “ 𝑍))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3060  Vcvv 3446   ∩ cin 3912   ⊆ wss 3913  ifcif 4491  𝒫 cpw 4565   class class class wbr 5110   ↦ cmpt 5193  dom cdm 5638  ran crn 5639   “ cima 5641  Fun wfun 6495   Fn wfn 6496  ⟶wf 6497  ‘cfv 6501  (class class class)co 7362   ≤ cle 11199  ℤcz 12508  ℤ_≥cuz 12772   ↾_t crest 17316

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5247  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677  ax-cnex 11116  ax-resscn 11117  ax-pre-lttri 11134  ax-pre-lttrn 11135

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-id 5536  df-po 5550  df-so 5551  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-ov 7365  df-oprab 7366  df-mpo 7367  df-er 8655  df-en 8891  df-dom 8892  df-sdom 8893  df-pnf 11200  df-mnf 11201  df-xr 11202  df-ltxr 11203  df-le 11204  df-neg 11397  df-z 12509  df-uz 12773  df-rest 17318

This theorem is referenced by:  uzfbas  23286