![]() |
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 9291 | . . . 4 ⊢ (𝐵 ∈ ℤ → (𝐵 + 1) ∈ ℤ) | |
2 | 1 | ad2antrl 490 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) → (𝐵 + 1) ∈ ℤ) |
3 | zre 9259 | . . . . 5 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
4 | zre 9259 | . . . . 5 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
5 | lep1 8804 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → 𝐵 ≤ (𝐵 + 1)) | |
6 | 5 | adantl 277 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ≤ (𝐵 + 1)) |
7 | peano2re 8095 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → (𝐵 + 1) ∈ ℝ) | |
8 | 7 | ancli 323 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) |
9 | letr 8042 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ (𝐵 + 1)) → 𝐴 ≤ (𝐵 + 1))) | |
10 | 9 | 3expb 1204 | . . . . . . 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 4009 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ≤ 𝑥 ↔ 𝐴 ≤ 𝐵)) | |
17 | 16 | elrab 2895 | . . 3 ⊢ (𝐵 ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥} ↔ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) |
18 | 17 | anbi2i 457 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥}) ↔ (𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵))) |
19 | breq2 4009 | . . 3 ⊢ (𝑥 = (𝐵 + 1) → (𝐴 ≤ 𝑥 ↔ 𝐴 ≤ (𝐵 + 1))) | |
20 | 19 | elrab 2895 | . 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 2148 {crab 2459 class class class wbr 4005 (class class class)co 5877 ℝcr 7812 1c1 7814 + caddc 7816 ≤ cle 7995 ℤcz 9255 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-addcom 7913 ax-addass 7915 ax-distr 7917 ax-i2m1 7918 ax-0lt1 7919 ax-0id 7921 ax-rnegex 7922 ax-cnre 7924 ax-pre-ltirr 7925 ax-pre-ltwlin 7926 ax-pre-lttrn 7927 ax-pre-ltadd 7929 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2741 df-sbc 2965 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-br 4006 df-opab 4067 df-id 4295 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-iota 5180 df-fun 5220 df-fv 5226 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-pnf 7996 df-mnf 7997 df-xr 7998 df-ltxr 7999 df-le 8000 df-sub 8132 df-neg 8133 df-inn 8922 df-n0 9179 df-z 9256 |
This theorem is referenced by: dfuzi 9365 |
Copyright terms: Public domain | W3C validator |