![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > ssuzfz | Structured version Visualization version GIF version |
Description: A finite subset of the upper integers is a subset of a finite set of sequential integers. (Contributed by Glauco Siliprandi, 11-Oct-2020.) |
Ref | Expression |
---|---|
ssuzfz.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
ssuzfz.2 | ⊢ (𝜑 → 𝐴 ⊆ 𝑍) |
ssuzfz.3 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
Ref | Expression |
---|---|
ssuzfz | ⊢ (𝜑 → 𝐴 ⊆ (𝑀...sup(𝐴, ℝ, < ))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssuzfz.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ 𝑍) | |
2 | 1 | sselda 3978 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝑍) |
3 | ssuzfz.1 | . . . . . . 7 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
4 | 2, 3 | eleqtrdi 2838 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ (ℤ≥‘𝑀)) |
5 | eluzel2 12851 | . . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
6 | 4, 5 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑀 ∈ ℤ) |
7 | uzssz 12867 | . . . . . . . . . 10 ⊢ (ℤ≥‘𝑀) ⊆ ℤ | |
8 | 3, 7 | eqsstri 4012 | . . . . . . . . 9 ⊢ 𝑍 ⊆ ℤ |
9 | 8 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → 𝑍 ⊆ ℤ) |
10 | 1, 9 | sstrd 3988 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℤ) |
11 | 10 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐴 ⊆ ℤ) |
12 | ne0i 4330 | . . . . . . . 8 ⊢ (𝑘 ∈ 𝐴 → 𝐴 ≠ ∅) | |
13 | 12 | adantl 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐴 ≠ ∅) |
14 | ssuzfz.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
15 | 14 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐴 ∈ Fin) |
16 | suprfinzcl 12700 | . . . . . . 7 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → sup(𝐴, ℝ, < ) ∈ 𝐴) | |
17 | 11, 13, 15, 16 | syl3anc 1369 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → sup(𝐴, ℝ, < ) ∈ 𝐴) |
18 | 11, 17 | sseldd 3979 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → sup(𝐴, ℝ, < ) ∈ ℤ) |
19 | 10 | sselda 3978 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ ℤ) |
20 | eluzle 12859 | . . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝑘) | |
21 | 4, 20 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑀 ≤ 𝑘) |
22 | zssre 12589 | . . . . . . . . 9 ⊢ ℤ ⊆ ℝ | |
23 | 22 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → ℤ ⊆ ℝ) |
24 | 10, 23 | sstrd 3988 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
25 | 24 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐴 ⊆ ℝ) |
26 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝐴) | |
27 | eqidd 2728 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → sup(𝐴, ℝ, < ) = sup(𝐴, ℝ, < )) | |
28 | 25, 15, 26, 27 | supfirege 12225 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ≤ sup(𝐴, ℝ, < )) |
29 | 6, 18, 19, 21, 28 | elfzd 13518 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ (𝑀...sup(𝐴, ℝ, < ))) |
30 | 29 | ex 412 | . . 3 ⊢ (𝜑 → (𝑘 ∈ 𝐴 → 𝑘 ∈ (𝑀...sup(𝐴, ℝ, < )))) |
31 | 30 | ralrimiv 3140 | . 2 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑘 ∈ (𝑀...sup(𝐴, ℝ, < ))) |
32 | dfss3 3966 | . 2 ⊢ (𝐴 ⊆ (𝑀...sup(𝐴, ℝ, < )) ↔ ∀𝑘 ∈ 𝐴 𝑘 ∈ (𝑀...sup(𝐴, ℝ, < ))) | |
33 | 31, 32 | sylibr 233 | 1 ⊢ (𝜑 → 𝐴 ⊆ (𝑀...sup(𝐴, ℝ, < ))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ≠ wne 2935 ∀wral 3056 ⊆ wss 3944 ∅c0 4318 class class class wbr 5142 ‘cfv 6542 (class class class)co 7414 Fincfn 8957 supcsup 9457 ℝcr 11131 < clt 11272 ≤ cle 11273 ℤcz 12582 ℤ≥cuz 12846 ...cfz 13510 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11188 ax-resscn 11189 ax-1cn 11190 ax-icn 11191 ax-addcl 11192 ax-addrcl 11193 ax-mulcl 11194 ax-mulrcl 11195 ax-mulcom 11196 ax-addass 11197 ax-mulass 11198 ax-distr 11199 ax-i2m1 11200 ax-1ne0 11201 ax-1rid 11202 ax-rnegex 11203 ax-rrecex 11204 ax-cnre 11205 ax-pre-lttri 11206 ax-pre-lttrn 11207 ax-pre-ltadd 11208 ax-pre-mulgt0 11209 ax-pre-sup 11210 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7865 df-1st 7987 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-er 8718 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9459 df-pnf 11274 df-mnf 11275 df-xr 11276 df-ltxr 11277 df-le 11278 df-sub 11470 df-neg 11471 df-nn 12237 df-n0 12497 df-z 12583 df-uz 12847 df-fz 13511 |
This theorem is referenced by: sge0isum 45787 |
Copyright terms: Public domain | W3C validator |