Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > peano2uz2 | Structured version Visualization version 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 12117 | . . . 4 ⊢ (𝐵 ∈ ℤ → (𝐵 + 1) ∈ ℤ) | |
2 | 1 | ad2antrl 728 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) → (𝐵 + 1) ∈ ℤ) |
3 | zre 12079 | . . . . 5 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
4 | zre 12079 | . . . . 5 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
5 | lep1 11572 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → 𝐵 ≤ (𝐵 + 1)) | |
6 | 5 | adantl 485 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ≤ (𝐵 + 1)) |
7 | peano2re 10904 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → (𝐵 + 1) ∈ ℝ) | |
8 | 7 | ancli 552 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) |
9 | letr 10825 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ (𝐵 + 1)) → 𝐴 ≤ (𝐵 + 1))) | |
10 | 9 | 3expb 1121 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ)) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ (𝐵 + 1)) → 𝐴 ≤ (𝐵 + 1))) |
11 | 8, 10 | sylan2 596 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ (𝐵 + 1)) → 𝐴 ≤ (𝐵 + 1))) |
12 | 6, 11 | mpan2d 694 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → 𝐴 ≤ (𝐵 + 1))) |
13 | 3, 4, 12 | syl2an 599 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 ≤ 𝐵 → 𝐴 ≤ (𝐵 + 1))) |
14 | 13 | impr 458 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) → 𝐴 ≤ (𝐵 + 1)) |
15 | 2, 14 | jca 515 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) → ((𝐵 + 1) ∈ ℤ ∧ 𝐴 ≤ (𝐵 + 1))) |
16 | breq2 5044 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ≤ 𝑥 ↔ 𝐴 ≤ 𝐵)) | |
17 | 16 | elrab 3593 | . . 3 ⊢ (𝐵 ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥} ↔ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵)) |
18 | 17 | anbi2i 626 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥}) ↔ (𝐴 ∈ ℤ ∧ (𝐵 ∈ ℤ ∧ 𝐴 ≤ 𝐵))) |
19 | breq2 5044 | . . 3 ⊢ (𝑥 = (𝐵 + 1) → (𝐴 ≤ 𝑥 ↔ 𝐴 ≤ (𝐵 + 1))) | |
20 | 19 | elrab 3593 | . 2 ⊢ ((𝐵 + 1) ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥} ↔ ((𝐵 + 1) ∈ ℤ ∧ 𝐴 ≤ (𝐵 + 1))) |
21 | 15, 18, 20 | 3imtr4i 295 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥}) → (𝐵 + 1) ∈ {𝑥 ∈ ℤ ∣ 𝐴 ≤ 𝑥}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2114 {crab 3058 class class class wbr 5040 (class class class)co 7183 ℝcr 10627 1c1 10629 + caddc 10631 ≤ cle 10767 ℤcz 12075 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2711 ax-sep 5177 ax-nul 5184 ax-pow 5242 ax-pr 5306 ax-un 7492 ax-resscn 10685 ax-1cn 10686 ax-icn 10687 ax-addcl 10688 ax-addrcl 10689 ax-mulcl 10690 ax-mulrcl 10691 ax-mulcom 10692 ax-addass 10693 ax-mulass 10694 ax-distr 10695 ax-i2m1 10696 ax-1ne0 10697 ax-1rid 10698 ax-rnegex 10699 ax-rrecex 10700 ax-cnre 10701 ax-pre-lttri 10702 ax-pre-lttrn 10703 ax-pre-ltadd 10704 ax-pre-mulgt0 10705 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2541 df-eu 2571 df-clab 2718 df-cleq 2731 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rab 3063 df-v 3402 df-sbc 3686 df-csb 3801 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4222 df-if 4425 df-pw 4500 df-sn 4527 df-pr 4529 df-tp 4531 df-op 4533 df-uni 4807 df-iun 4893 df-br 5041 df-opab 5103 df-mpt 5121 df-tr 5147 df-id 5439 df-eprel 5444 df-po 5452 df-so 5453 df-fr 5493 df-we 5495 df-xp 5541 df-rel 5542 df-cnv 5543 df-co 5544 df-dm 5545 df-rn 5546 df-res 5547 df-ima 5548 df-pred 6139 df-ord 6186 df-on 6187 df-lim 6188 df-suc 6189 df-iota 6308 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7140 df-ov 7186 df-oprab 7187 df-mpo 7188 df-om 7613 df-wrecs 7989 df-recs 8050 df-rdg 8088 df-er 8333 df-en 8569 df-dom 8570 df-sdom 8571 df-pnf 10768 df-mnf 10769 df-xr 10770 df-ltxr 10771 df-le 10772 df-sub 10963 df-neg 10964 df-nn 11730 df-n0 11990 df-z 12076 |
This theorem is referenced by: dfuzi 12167 |
Copyright terms: Public domain | W3C validator |