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

Theorem nn2ge 9272
Description: There exists a positive integer greater than or equal to any two others. (Contributed by NM, 18-Aug-1999.)
Assertion
Ref Expression
nn2ge ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ∃𝑥 ∈ ℕ (𝐴𝑥𝐵𝑥))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nn2ge
StepHypRef Expression
1 nnaddcl 9259 . 2 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 + 𝐵) ∈ ℕ)
2 0red 8277 . . . 4 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 ∈ ℝ)
3 nnre 9246 . . . . 5 (𝐵 ∈ ℕ → 𝐵 ∈ ℝ)
43adantl 277 . . . 4 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℝ)
5 nngt0 9264 . . . . 5 (𝐵 ∈ ℕ → 0 < 𝐵)
65adantl 277 . . . 4 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐵)
72, 4, 6ltled 8394 . . 3 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 ≤ 𝐵)
8 nnre 9246 . . . . 5 (𝐴 ∈ ℕ → 𝐴 ∈ ℝ)
98adantr 276 . . . 4 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℝ)
109, 4addge01d 8809 . . 3 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (0 ≤ 𝐵𝐴 ≤ (𝐴 + 𝐵)))
117, 10mpbid 147 . 2 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ≤ (𝐴 + 𝐵))
12 nngt0 9264 . . . . 5 (𝐴 ∈ ℕ → 0 < 𝐴)
1312adantr 276 . . . 4 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐴)
142, 9, 13ltled 8394 . . 3 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 ≤ 𝐴)
154, 9addge02d 8810 . . 3 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (0 ≤ 𝐴𝐵 ≤ (𝐴 + 𝐵)))
1614, 15mpbid 147 . 2 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ≤ (𝐴 + 𝐵))
17 breq2 4115 . . . 4 (𝑥 = (𝐴 + 𝐵) → (𝐴𝑥𝐴 ≤ (𝐴 + 𝐵)))
18 breq2 4115 . . . 4 (𝑥 = (𝐴 + 𝐵) → (𝐵𝑥𝐵 ≤ (𝐴 + 𝐵)))
1917, 18anbi12d 473 . . 3 (𝑥 = (𝐴 + 𝐵) → ((𝐴𝑥𝐵𝑥) ↔ (𝐴 ≤ (𝐴 + 𝐵) ∧ 𝐵 ≤ (𝐴 + 𝐵))))
2019rspcev 2923 . 2 (((𝐴 + 𝐵) ∈ ℕ ∧ (𝐴 ≤ (𝐴 + 𝐵) ∧ 𝐵 ≤ (𝐴 + 𝐵))) → ∃𝑥 ∈ ℕ (𝐴𝑥𝐵𝑥))
211, 11, 16, 20syl12anc 1272 1 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ∃𝑥 ∈ ℕ (𝐴𝑥𝐵𝑥))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2205  wrex 2523   class class class wbr 4111  (class class class)co 6052  cr 8128  0cc0 8129   + caddc 8132   < clt 8310  cle 8311  cn 9239
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-ltadd 8245
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-br 4112  df-opab 4174  df-xp 4757  df-cnv 4759  df-iota 5314  df-fv 5362  df-ov 6055  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-inn 9240
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator