![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nn2ge | GIF version |
Description: There exists a positive integer greater than or equal to any two others. (Contributed by NM, 18-Aug-1999.) |
Ref | Expression |
---|---|
nn2ge | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ∃𝑥 ∈ ℕ (𝐴 ≤ 𝑥 ∧ 𝐵 ≤ 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnaddcl 8764 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 + 𝐵) ∈ ℕ) | |
2 | 0red 7791 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 ∈ ℝ) | |
3 | nnre 8751 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℝ) | |
4 | 3 | adantl 275 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℝ) |
5 | nngt0 8769 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 0 < 𝐵) | |
6 | 5 | adantl 275 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐵) |
7 | 2, 4, 6 | ltled 7905 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 ≤ 𝐵) |
8 | nnre 8751 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ) | |
9 | 8 | adantr 274 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℝ) |
10 | 9, 4 | addge01d 8319 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (0 ≤ 𝐵 ↔ 𝐴 ≤ (𝐴 + 𝐵))) |
11 | 7, 10 | mpbid 146 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ≤ (𝐴 + 𝐵)) |
12 | nngt0 8769 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 0 < 𝐴) | |
13 | 12 | adantr 274 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐴) |
14 | 2, 9, 13 | ltled 7905 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 ≤ 𝐴) |
15 | 4, 9 | addge02d 8320 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (0 ≤ 𝐴 ↔ 𝐵 ≤ (𝐴 + 𝐵))) |
16 | 14, 15 | mpbid 146 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ≤ (𝐴 + 𝐵)) |
17 | breq2 3941 | . . . 4 ⊢ (𝑥 = (𝐴 + 𝐵) → (𝐴 ≤ 𝑥 ↔ 𝐴 ≤ (𝐴 + 𝐵))) | |
18 | breq2 3941 | . . . 4 ⊢ (𝑥 = (𝐴 + 𝐵) → (𝐵 ≤ 𝑥 ↔ 𝐵 ≤ (𝐴 + 𝐵))) | |
19 | 17, 18 | anbi12d 465 | . . 3 ⊢ (𝑥 = (𝐴 + 𝐵) → ((𝐴 ≤ 𝑥 ∧ 𝐵 ≤ 𝑥) ↔ (𝐴 ≤ (𝐴 + 𝐵) ∧ 𝐵 ≤ (𝐴 + 𝐵)))) |
20 | 19 | rspcev 2793 | . 2 ⊢ (((𝐴 + 𝐵) ∈ ℕ ∧ (𝐴 ≤ (𝐴 + 𝐵) ∧ 𝐵 ≤ (𝐴 + 𝐵))) → ∃𝑥 ∈ ℕ (𝐴 ≤ 𝑥 ∧ 𝐵 ≤ 𝑥)) |
21 | 1, 11, 16, 20 | syl12anc 1215 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ∃𝑥 ∈ ℕ (𝐴 ≤ 𝑥 ∧ 𝐵 ≤ 𝑥)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1332 ∈ wcel 1481 ∃wrex 2418 class class class wbr 3937 (class class class)co 5782 ℝcr 7643 0cc0 7644 + caddc 7647 < clt 7824 ≤ cle 7825 ℕcn 8744 |
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 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 ax-un 4363 ax-setind 4460 ax-cnex 7735 ax-resscn 7736 ax-1cn 7737 ax-1re 7738 ax-icn 7739 ax-addcl 7740 ax-addrcl 7741 ax-mulcl 7742 ax-addcom 7744 ax-addass 7746 ax-i2m1 7749 ax-0lt1 7750 ax-0id 7752 ax-rnegex 7753 ax-pre-ltirr 7756 ax-pre-ltwlin 7757 ax-pre-lttrn 7758 ax-pre-ltadd 7760 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-nel 2405 df-ral 2422 df-rex 2423 df-rab 2426 df-v 2691 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-int 3780 df-br 3938 df-opab 3998 df-xp 4553 df-cnv 4555 df-iota 5096 df-fv 5139 df-ov 5785 df-pnf 7826 df-mnf 7827 df-xr 7828 df-ltxr 7829 df-le 7830 df-inn 8745 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |