| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > peano2uz2 | GIF version | ||
| Description: Second Peano postulate for upper integers. (Contributed by NM, 3-Oct-2004.) |
| Ref | Expression |
|---|---|
| peano2uz2 | ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥}) → (𝐵 + 1) ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | peano2z 9559 | . . . 4 ⊢ (𝐵 ∈ ℤ → (𝐵 + 1) ∈ ℤ) | |
| 2 | 1 | ad2antrl 490 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) → (𝐵 + 1) ∈ ℤ) |
| 3 | zre 9527 | . . . . 5 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
| 4 | zre 9527 | . . . . 5 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
| 5 | lep1 9067 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → 𝐵 ≤ (𝐵 + 1)) | |
| 6 | 5 | adantl 277 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ≤ (𝐵 + 1)) |
| 7 | peano2re 8357 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → (𝐵 + 1) ∈ ℝ) | |
| 8 | 7 | ancli 323 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) |
| 9 | letr 8304 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ (𝐵 + 1)) → 𝐴 ≤ (𝐵 + 1))) | |
| 10 | 9 | 3expb 1231 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ (𝐵 + 1)) → 𝐴 ≤ (𝐵 + 1))) |
| 11 | 8, 10 | sylan2 286 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ (𝐵 + 1)) → 𝐴 ≤ (𝐵 + 1))) |
| 12 | 6, 11 | mpan2d 428 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → 𝐴 ≤ (𝐵 + 1))) |
| 13 | 3, 4, 12 | syl2an 289 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 ≤ 𝐵 → 𝐴 ≤ (𝐵 + 1))) |
| 14 | 13 | impr 379 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) → 𝐴 ≤ (𝐵 + 1)) |
| 15 | 2, 14 | jca 306 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) → ((𝐵 + 1) ∈ ℤ ∧ 𝐴 ≤ (𝐵 + 1))) |
| 16 | breq2 4097 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ≤ 𝑥 ↔ 𝐴 ≤ 𝐵)) | |
| 17 | 16 | elrab 2963 | . . 3 ⊢ (𝐵 ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥} ↔ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) |
| 18 | 17 | anbi2i 457 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥}) ↔ (𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵))) |
| 19 | breq2 4097 | . . 3 ⊢ (𝑥 = (𝐵 + 1) → (𝐴 ≤ 𝑥 ↔ 𝐴 ≤ (𝐵 + 1))) | |
| 20 | 19 | elrab 2963 | . 2 ⊢ ((𝐵 + 1) ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥} ↔ ((𝐵 + 1) ∈ ℤ ∧ 𝐴 ≤ (𝐵 + 1))) |
| 21 | 15, 18, 20 | 3imtr4i 201 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥}) → (𝐵 + 1) ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2202 {crab 2515 class class class wbr 4093 (class class class)co 6028 ℝcr 8074 1c1 8076 + caddc 8078 ≤ cle 8257 ℤcz 9523 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-inn 9186 df-n0 9445 df-z 9524 |
| This theorem is referenced by: dfuzi 9634 |
| Copyright terms: Public domain | W3C validator |