![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nnminle | GIF version |
Description: The infimum of a decidable subset of the natural numbers is less than an element of the set. The infimum is also a minimum as shown at nnmindc 12037. (Contributed by Jim Kingdon, 26-Sep-2024.) |
Ref | Expression |
---|---|
nnminle | ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → inf(𝐴, ℝ, < ) ≤ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfss5 3342 | . . . . . 6 ⊢ (𝐴 ⊆ ℕ ↔ 𝐴 = (ℕ ∩ 𝐴)) | |
2 | 1 | biimpi 120 | . . . . 5 ⊢ (𝐴 ⊆ ℕ → 𝐴 = (ℕ ∩ 𝐴)) |
3 | nnuz 9565 | . . . . . . 7 ⊢ ℕ = (ℤ≥‘1) | |
4 | 3 | ineq1i 3334 | . . . . . 6 ⊢ (ℕ ∩ 𝐴) = ((ℤ≥‘1) ∩ 𝐴) |
5 | dfin5 3138 | . . . . . 6 ⊢ ((ℤ≥‘1) ∩ 𝐴) = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴} | |
6 | 4, 5 | eqtri 2198 | . . . . 5 ⊢ (ℕ ∩ 𝐴) = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴} |
7 | 2, 6 | eqtrdi 2226 | . . . 4 ⊢ (𝐴 ⊆ ℕ → 𝐴 = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}) |
8 | 7 | 3ad2ant1 1018 | . . 3 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐴 = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}) |
9 | 8 | infeq1d 7013 | . 2 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → inf(𝐴, ℝ, < ) = inf({𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}, ℝ, < )) |
10 | 1zzd 9282 | . . 3 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → 1 ∈ ℤ) | |
11 | eqid 2177 | . . 3 ⊢ {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴} = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴} | |
12 | simp3 999 | . . . 4 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐴) | |
13 | 12, 8 | eleqtrd 2256 | . . 3 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}) |
14 | eleq1w 2238 | . . . . 5 ⊢ (𝑥 = 𝑛 → (𝑥 ∈ 𝐴 ↔ 𝑛 ∈ 𝐴)) | |
15 | 14 | dcbid 838 | . . . 4 ⊢ (𝑥 = 𝑛 → (DECID 𝑥 ∈ 𝐴 ↔ DECID 𝑛 ∈ 𝐴)) |
16 | simpl2 1001 | . . . 4 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑛 ∈ (1...𝐵)) → ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴) | |
17 | elfznn 10056 | . . . . 5 ⊢ (𝑛 ∈ (1...𝐵) → 𝑛 ∈ ℕ) | |
18 | 17 | adantl 277 | . . . 4 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑛 ∈ (1...𝐵)) → 𝑛 ∈ ℕ) |
19 | 15, 16, 18 | rspcdva 2848 | . . 3 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑛 ∈ (1...𝐵)) → DECID 𝑛 ∈ 𝐴) |
20 | 10, 11, 13, 19 | infssuzledc 11953 | . 2 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → inf({𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}, ℝ, < ) ≤ 𝐵) |
21 | 9, 20 | eqbrtrd 4027 | 1 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → inf(𝐴, ℝ, < ) ≤ 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 DECID wdc 834 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ∀wral 2455 {crab 2459 ∩ cin 3130 ⊆ wss 3131 class class class wbr 4005 ‘cfv 5218 (class class class)co 5877 infcinf 6984 ℝcr 7812 1c1 7814 < clt 7994 ≤ cle 7995 ℕcn 8921 ℤ≥cuz 9530 ...cfz 10010 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-addcom 7913 ax-addass 7915 ax-distr 7917 ax-i2m1 7918 ax-0lt1 7919 ax-0id 7921 ax-rnegex 7922 ax-cnre 7924 ax-pre-ltirr 7925 ax-pre-ltwlin 7926 ax-pre-lttrn 7927 ax-pre-apti 7928 ax-pre-ltadd 7929 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-id 4295 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-fv 5226 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-1st 6143 df-2nd 6144 df-sup 6985 df-inf 6986 df-pnf 7996 df-mnf 7997 df-xr 7998 df-ltxr 7999 df-le 8000 df-sub 8132 df-neg 8133 df-inn 8922 df-n0 9179 df-z 9256 df-uz 9531 df-fz 10011 df-fzo 10145 |
This theorem is referenced by: nnwodc 12039 |
Copyright terms: Public domain | W3C validator |