![]() |
Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > nnubfi | Structured version Visualization version GIF version |
Description: A bounded above set of positive integers is finite. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 28-Feb-2014.) |
Ref | Expression |
---|---|
nnubfi | ⊢ ((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) → {𝑥 ∈ 𝐴 ∣ 𝑥 < 𝐵} ∈ Fin) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fzfi 12633 | . 2 ⊢ (0...𝐵) ∈ Fin | |
2 | ssel2 3563 | . . . . . . . . 9 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℕ) | |
3 | nnnn0 11176 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℕ0) | |
4 | 2, 3 | syl 17 | . . . . . . . 8 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℕ0) |
5 | 4 | adantlr 747 | . . . . . . 7 ⊢ (((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℕ0) |
6 | 5 | adantr 480 | . . . . . 6 ⊢ ((((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 < 𝐵) → 𝑥 ∈ ℕ0) |
7 | nnnn0 11176 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℕ0) | |
8 | 7 | ad3antlr 763 | . . . . . 6 ⊢ ((((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 < 𝐵) → 𝐵 ∈ ℕ0) |
9 | nnre 10904 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℝ) | |
10 | 2, 9 | syl 17 | . . . . . . . . 9 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ) |
11 | 10 | adantlr 747 | . . . . . . . 8 ⊢ (((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ) |
12 | nnre 10904 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℝ) | |
13 | 12 | ad2antlr 759 | . . . . . . . 8 ⊢ (((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ) |
14 | ltle 10005 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑥 < 𝐵 → 𝑥 ≤ 𝐵)) | |
15 | 11, 13, 14 | syl2anc 691 | . . . . . . 7 ⊢ (((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑥 ∈ 𝐴) → (𝑥 < 𝐵 → 𝑥 ≤ 𝐵)) |
16 | 15 | imp 444 | . . . . . 6 ⊢ ((((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 < 𝐵) → 𝑥 ≤ 𝐵) |
17 | elfz2nn0 12300 | . . . . . 6 ⊢ (𝑥 ∈ (0...𝐵) ↔ (𝑥 ∈ ℕ0 ∧ 𝐵 ∈ ℕ0 ∧ 𝑥 ≤ 𝐵)) | |
18 | 6, 8, 16, 17 | syl3anbrc 1239 | . . . . 5 ⊢ ((((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 < 𝐵) → 𝑥 ∈ (0...𝐵)) |
19 | 18 | ex 449 | . . . 4 ⊢ (((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑥 ∈ 𝐴) → (𝑥 < 𝐵 → 𝑥 ∈ (0...𝐵))) |
20 | 19 | ralrimiva 2949 | . . 3 ⊢ ((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) → ∀𝑥 ∈ 𝐴 (𝑥 < 𝐵 → 𝑥 ∈ (0...𝐵))) |
21 | rabss 3642 | . . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝑥 < 𝐵} ⊆ (0...𝐵) ↔ ∀𝑥 ∈ 𝐴 (𝑥 < 𝐵 → 𝑥 ∈ (0...𝐵))) | |
22 | 20, 21 | sylibr 223 | . 2 ⊢ ((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) → {𝑥 ∈ 𝐴 ∣ 𝑥 < 𝐵} ⊆ (0...𝐵)) |
23 | ssfi 8065 | . 2 ⊢ (((0...𝐵) ∈ Fin ∧ {𝑥 ∈ 𝐴 ∣ 𝑥 < 𝐵} ⊆ (0...𝐵)) → {𝑥 ∈ 𝐴 ∣ 𝑥 < 𝐵} ∈ Fin) | |
24 | 1, 22, 23 | sylancr 694 | 1 ⊢ ((𝐴 ⊆ ℕ ∧ 𝐵 ∈ ℕ) → {𝑥 ∈ 𝐴 ∣ 𝑥 < 𝐵} ∈ Fin) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∈ wcel 1977 ∀wral 2896 {crab 2900 ⊆ wss 3540 class class class wbr 4583 (class class class)co 6549 Fincfn 7841 ℝcr 9814 0cc0 9815 < clt 9953 ≤ cle 9954 ℕcn 10897 ℕ0cn0 11169 ...cfz 12197 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |