ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nnminle GIF version

Theorem nnminle 12298
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 12297. (Contributed by Jim Kingdon, 26-Sep-2024.)
Assertion
Ref Expression
nnminle ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) → inf(𝐴, ℝ, < ) ≤ 𝐵)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem nnminle
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 dfss5 3377 . . . . . 6 (𝐴 ⊆ ℕ ↔ 𝐴 = (ℕ ∩ 𝐴))
21biimpi 120 . . . . 5 (𝐴 ⊆ ℕ → 𝐴 = (ℕ ∩ 𝐴))
3 nnuz 9683 . . . . . . 7 ℕ = (ℤ‘1)
43ineq1i 3369 . . . . . 6 (ℕ ∩ 𝐴) = ((ℤ‘1) ∩ 𝐴)
5 dfin5 3172 . . . . . 6 ((ℤ‘1) ∩ 𝐴) = {𝑛 ∈ (ℤ‘1) ∣ 𝑛𝐴}
64, 5eqtri 2225 . . . . 5 (ℕ ∩ 𝐴) = {𝑛 ∈ (ℤ‘1) ∣ 𝑛𝐴}
72, 6eqtrdi 2253 . . . 4 (𝐴 ⊆ ℕ → 𝐴 = {𝑛 ∈ (ℤ‘1) ∣ 𝑛𝐴})
873ad2ant1 1020 . . 3 ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) → 𝐴 = {𝑛 ∈ (ℤ‘1) ∣ 𝑛𝐴})
98infeq1d 7113 . 2 ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) → inf(𝐴, ℝ, < ) = inf({𝑛 ∈ (ℤ‘1) ∣ 𝑛𝐴}, ℝ, < ))
10 1zzd 9398 . . 3 ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) → 1 ∈ ℤ)
11 eqid 2204 . . 3 {𝑛 ∈ (ℤ‘1) ∣ 𝑛𝐴} = {𝑛 ∈ (ℤ‘1) ∣ 𝑛𝐴}
12 simp3 1001 . . . 4 ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) → 𝐵𝐴)
1312, 8eleqtrd 2283 . . 3 ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) → 𝐵 ∈ {𝑛 ∈ (ℤ‘1) ∣ 𝑛𝐴})
14 eleq1w 2265 . . . . 5 (𝑥 = 𝑛 → (𝑥𝐴𝑛𝐴))
1514dcbid 839 . . . 4 (𝑥 = 𝑛 → (DECID 𝑥𝐴DECID 𝑛𝐴))
16 simpl2 1003 . . . 4 (((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) ∧ 𝑛 ∈ (1...𝐵)) → ∀𝑥 ∈ ℕ DECID 𝑥𝐴)
17 elfznn 10175 . . . . 5 (𝑛 ∈ (1...𝐵) → 𝑛 ∈ ℕ)
1817adantl 277 . . . 4 (((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) ∧ 𝑛 ∈ (1...𝐵)) → 𝑛 ∈ ℕ)
1915, 16, 18rspcdva 2881 . . 3 (((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) ∧ 𝑛 ∈ (1...𝐵)) → DECID 𝑛𝐴)
2010, 11, 13, 19infssuzledc 10375 . 2 ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) → inf({𝑛 ∈ (ℤ‘1) ∣ 𝑛𝐴}, ℝ, < ) ≤ 𝐵)
219, 20eqbrtrd 4065 1 ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥𝐴𝐵𝐴) → inf(𝐴, ℝ, < ) ≤ 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 835  w3a 980   = wceq 1372  wcel 2175  wral 2483  {crab 2487  cin 3164  wss 3165   class class class wbr 4043  cfv 5270  (class class class)co 5943  infcinf 7084  cr 7923  1c1 7925   < clt 8106  cle 8107  cn 9035  cuz 9647  ...cfz 10129
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 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-cnex 8015  ax-resscn 8016  ax-1cn 8017  ax-1re 8018  ax-icn 8019  ax-addcl 8020  ax-addrcl 8021  ax-mulcl 8022  ax-addcom 8024  ax-addass 8026  ax-distr 8028  ax-i2m1 8029  ax-0lt1 8030  ax-0id 8032  ax-rnegex 8033  ax-cnre 8035  ax-pre-ltirr 8036  ax-pre-ltwlin 8037  ax-pre-lttrn 8038  ax-pre-apti 8039  ax-pre-ltadd 8040
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-nel 2471  df-ral 2488  df-rex 2489  df-reu 2490  df-rmo 2491  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-fv 5278  df-riota 5898  df-ov 5946  df-oprab 5947  df-mpo 5948  df-1st 6225  df-2nd 6226  df-sup 7085  df-inf 7086  df-pnf 8108  df-mnf 8109  df-xr 8110  df-ltxr 8111  df-le 8112  df-sub 8244  df-neg 8245  df-inn 9036  df-n0 9295  df-z 9372  df-uz 9648  df-fz 10130  df-fzo 10264
This theorem is referenced by:  nnwodc  12299
  Copyright terms: Public domain W3C validator