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 11963. (Contributed by Jim Kingdon, 26-Sep-2024.) |
Ref | Expression |
---|---|
nnminle | ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → inf(𝐴, ℝ, < ) ≤ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfss5 3326 | . . . . . 6 ⊢ (𝐴 ⊆ ℕ ↔ 𝐴 = (ℕ ∩ 𝐴)) | |
2 | 1 | biimpi 119 | . . . . 5 ⊢ (𝐴 ⊆ ℕ → 𝐴 = (ℕ ∩ 𝐴)) |
3 | nnuz 9497 | . . . . . . 7 ⊢ ℕ = (ℤ≥‘1) | |
4 | 3 | ineq1i 3318 | . . . . . 6 ⊢ (ℕ ∩ 𝐴) = ((ℤ≥‘1) ∩ 𝐴) |
5 | dfin5 3122 | . . . . . 6 ⊢ ((ℤ≥‘1) ∩ 𝐴) = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴} | |
6 | 4, 5 | eqtri 2186 | . . . . 5 ⊢ (ℕ ∩ 𝐴) = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴} |
7 | 2, 6 | eqtrdi 2214 | . . . 4 ⊢ (𝐴 ⊆ ℕ → 𝐴 = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}) |
8 | 7 | 3ad2ant1 1008 | . . 3 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐴 = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}) |
9 | 8 | infeq1d 6973 | . 2 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → inf(𝐴, ℝ, < ) = inf({𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}, ℝ, < )) |
10 | 1zzd 9214 | . . 3 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → 1 ∈ ℤ) | |
11 | eqid 2165 | . . 3 ⊢ {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴} = {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴} | |
12 | simp3 989 | . . . 4 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐴) | |
13 | 12, 8 | eleqtrd 2244 | . . 3 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ {𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}) |
14 | eleq1w 2226 | . . . . 5 ⊢ (𝑥 = 𝑛 → (𝑥 ∈ 𝐴 ↔ 𝑛 ∈ 𝐴)) | |
15 | 14 | dcbid 828 | . . . 4 ⊢ (𝑥 = 𝑛 → (DECID 𝑥 ∈ 𝐴 ↔ DECID 𝑛 ∈ 𝐴)) |
16 | simpl2 991 | . . . 4 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑛 ∈ (1...𝐵)) → ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴) | |
17 | elfznn 9985 | . . . . 5 ⊢ (𝑛 ∈ (1...𝐵) → 𝑛 ∈ ℕ) | |
18 | 17 | adantl 275 | . . . 4 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑛 ∈ (1...𝐵)) → 𝑛 ∈ ℕ) |
19 | 15, 16, 18 | rspcdva 2834 | . . 3 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑛 ∈ (1...𝐵)) → DECID 𝑛 ∈ 𝐴) |
20 | 10, 11, 13, 19 | infssuzledc 11879 | . 2 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → inf({𝑛 ∈ (ℤ≥‘1) ∣ 𝑛 ∈ 𝐴}, ℝ, < ) ≤ 𝐵) |
21 | 9, 20 | eqbrtrd 4003 | 1 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → inf(𝐴, ℝ, < ) ≤ 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 DECID wdc 824 ∧ w3a 968 = wceq 1343 ∈ wcel 2136 ∀wral 2443 {crab 2447 ∩ cin 3114 ⊆ wss 3115 class class class wbr 3981 ‘cfv 5187 (class class class)co 5841 infcinf 6944 ℝcr 7748 1c1 7750 < clt 7929 ≤ cle 7930 ℕcn 8853 ℤ≥cuz 9462 ...cfz 9940 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4099 ax-pow 4152 ax-pr 4186 ax-un 4410 ax-setind 4513 ax-cnex 7840 ax-resscn 7841 ax-1cn 7842 ax-1re 7843 ax-icn 7844 ax-addcl 7845 ax-addrcl 7846 ax-mulcl 7847 ax-addcom 7849 ax-addass 7851 ax-distr 7853 ax-i2m1 7854 ax-0lt1 7855 ax-0id 7857 ax-rnegex 7858 ax-cnre 7860 ax-pre-ltirr 7861 ax-pre-ltwlin 7862 ax-pre-lttrn 7863 ax-pre-apti 7864 ax-pre-ltadd 7865 |
This theorem depends on definitions: df-bi 116 df-dc 825 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2296 df-ne 2336 df-nel 2431 df-ral 2448 df-rex 2449 df-reu 2450 df-rmo 2451 df-rab 2452 df-v 2727 df-sbc 2951 df-csb 3045 df-dif 3117 df-un 3119 df-in 3121 df-ss 3128 df-pw 3560 df-sn 3581 df-pr 3582 df-op 3584 df-uni 3789 df-int 3824 df-iun 3867 df-br 3982 df-opab 4043 df-mpt 4044 df-id 4270 df-xp 4609 df-rel 4610 df-cnv 4611 df-co 4612 df-dm 4613 df-rn 4614 df-res 4615 df-ima 4616 df-iota 5152 df-fun 5189 df-fn 5190 df-f 5191 df-fv 5195 df-riota 5797 df-ov 5844 df-oprab 5845 df-mpo 5846 df-1st 6105 df-2nd 6106 df-sup 6945 df-inf 6946 df-pnf 7931 df-mnf 7932 df-xr 7933 df-ltxr 7934 df-le 7935 df-sub 8067 df-neg 8068 df-inn 8854 df-n0 9111 df-z 9188 df-uz 9463 df-fz 9941 df-fzo 10074 |
This theorem is referenced by: nnwodc 11965 |
Copyright terms: Public domain | W3C validator |