| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 6p5lem | GIF version | ||
| Description: Lemma for 6p5e11 9828 and related theorems. (Contributed by Mario Carneiro, 19-Apr-2015.) |
| Ref | Expression |
|---|---|
| 6p5lem.1 | ⊢ 𝐴 ∈ ℕ0 |
| 6p5lem.2 | ⊢ 𝐷 ∈ ℕ0 |
| 6p5lem.3 | ⊢ 𝐸 ∈ ℕ0 |
| 6p5lem.4 | ⊢ 𝐵 = (𝐷 + 1) |
| 6p5lem.5 | ⊢ 𝐶 = (𝐸 + 1) |
| 6p5lem.6 | ⊢ (𝐴 + 𝐷) = ;1𝐸 |
| Ref | Expression |
|---|---|
| 6p5lem | ⊢ (𝐴 + 𝐵) = ;1𝐶 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 6p5lem.4 | . . 3 ⊢ 𝐵 = (𝐷 + 1) | |
| 2 | 1 | oveq2i 6086 | . 2 ⊢ (𝐴 + 𝐵) = (𝐴 + (𝐷 + 1)) |
| 3 | 6p5lem.1 | . . . 4 ⊢ 𝐴 ∈ ℕ0 | |
| 4 | 3 | nn0cni 9554 | . . 3 ⊢ 𝐴 ∈ ℂ |
| 5 | 6p5lem.2 | . . . 4 ⊢ 𝐷 ∈ ℕ0 | |
| 6 | 5 | nn0cni 9554 | . . 3 ⊢ 𝐷 ∈ ℂ |
| 7 | ax-1cn 8262 | . . 3 ⊢ 1 ∈ ℂ | |
| 8 | 4, 6, 7 | addassi 8324 | . 2 ⊢ ((𝐴 + 𝐷) + 1) = (𝐴 + (𝐷 + 1)) |
| 9 | 1nn0 9558 | . . 3 ⊢ 1 ∈ ℕ0 | |
| 10 | 6p5lem.3 | . . 3 ⊢ 𝐸 ∈ ℕ0 | |
| 11 | 6p5lem.5 | . . . 4 ⊢ 𝐶 = (𝐸 + 1) | |
| 12 | 11 | eqcomi 2242 | . . 3 ⊢ (𝐸 + 1) = 𝐶 |
| 13 | 6p5lem.6 | . . 3 ⊢ (𝐴 + 𝐷) = ;1𝐸 | |
| 14 | 9, 10, 12, 13 | decsuc 9786 | . 2 ⊢ ((𝐴 + 𝐷) + 1) = ;1𝐶 |
| 15 | 2, 8, 14 | 3eqtr2i 2265 | 1 ⊢ (𝐴 + 𝐵) = ;1𝐶 |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1402 ∈ wcel 2209 (class class class)co 6075 1c1 8170 + caddc 8172 ℕ0cn0 9542 ;cdc 9756 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-cnre 8280 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-br 4126 df-opab 4188 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-iota 5332 df-fun 5374 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-sub 8489 df-inn 9284 df-2 9342 df-3 9343 df-4 9344 df-5 9345 df-6 9346 df-7 9347 df-8 9348 df-9 9349 df-n0 9543 df-dec 9757 |
| This theorem is referenced by: 6p5e11 9828 6p6e12 9829 7p4e11 9831 7p5e12 9832 7p6e13 9833 7p7e14 9834 8p3e11 9836 8p4e12 9837 8p5e13 9838 8p6e14 9839 8p7e15 9840 8p8e16 9841 9p2e11 9842 9p3e12 9843 9p4e13 9844 9p5e14 9845 9p6e15 9846 9p7e16 9847 9p8e17 9848 9p9e18 9849 |
| Copyright terms: Public domain | W3C validator |