| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 6p5lem | GIF version | ||
| Description: Lemma for 6p5e11 9859 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 6096 | . 2 ⊢ (𝐴 + 𝐵) = (𝐴 + (𝐷 + 1)) |
| 3 | 6p5lem.1 | . . . 4 ⊢ 𝐴 ∈ ℕ0 | |
| 4 | 3 | nn0cni 9580 | . . 3 ⊢ 𝐴 ∈ ℂ |
| 5 | 6p5lem.2 | . . . 4 ⊢ 𝐷 ∈ ℕ0 | |
| 6 | 5 | nn0cni 9580 | . . 3 ⊢ 𝐷 ∈ ℂ |
| 7 | ax-1cn 8273 | . . 3 ⊢ 1 ∈ ℂ | |
| 8 | 4, 6, 7 | addassi 8335 | . 2 ⊢ ((𝐴 + 𝐷) + 1) = (𝐴 + (𝐷 + 1)) |
| 9 | 1nn0 9584 | . . 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 9817 | . 2 ⊢ ((𝐴 + 𝐷) + 1) = ;1𝐶 |
| 15 | 2, 8, 14 | 3eqtr2i 2265 | 1 ⊢ (𝐴 + 𝐵) = ;1𝐶 |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: = wceq 1402 ∈ wcel 2209 (class class class)co 6085 1c1 8181 + caddc 8183 ℕ0cn0 9568 ;cdc 9782 |
| This proof depends on 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 4249 ax-pow 4311 ax-pr 4346 ax-setind 4684 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-cnre 8291 |
| This proof 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 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-opab 4193 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-iota 5337 df-fun 5379 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-sub 8501 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-5 9369 df-6 9370 df-7 9371 df-8 9372 df-9 9373 df-n0 9569 df-dec 9783 |
| This theorem is used by: 6p5e11 9859 6p6e12 9860 7p4e11 9862 7p5e12 9863 7p6e13 9864 7p7e14 9865 8p3e11 9867 8p4e12 9868 8p5e13 9869 8p6e14 9870 8p7e15 9871 8p8e16 9872 9p2e11 9873 9p3e12 9874 9p4e13 9875 9p5e14 9876 9p6e15 9877 9p7e16 9878 9p8e17 9879 9p9e18 9880 |
| Copyright terms: Public domain | W3C validator |