| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 6p5lem | GIF version | ||
| Description: Lemma for 6p5e11 9682 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 6028 | . 2 ⊢ (𝐴 + 𝐵) = (𝐴 + (𝐷 + 1)) |
| 3 | 6p5lem.1 | . . . 4 ⊢ 𝐴 ∈ ℕ0 | |
| 4 | 3 | nn0cni 9413 | . . 3 ⊢ 𝐴 ∈ ℂ |
| 5 | 6p5lem.2 | . . . 4 ⊢ 𝐷 ∈ ℕ0 | |
| 6 | 5 | nn0cni 9413 | . . 3 ⊢ 𝐷 ∈ ℂ |
| 7 | ax-1cn 8124 | . . 3 ⊢ 1 ∈ ℂ | |
| 8 | 4, 6, 7 | addassi 8186 | . 2 ⊢ ((𝐴 + 𝐷) + 1) = (𝐴 + (𝐷 + 1)) |
| 9 | 1nn0 9417 | . . 3 ⊢ 1 ∈ ℕ0 | |
| 10 | 6p5lem.3 | . . 3 ⊢ 𝐸 ∈ ℕ0 | |
| 11 | 6p5lem.5 | . . . 4 ⊢ 𝐶 = (𝐸 + 1) | |
| 12 | 11 | eqcomi 2235 | . . 3 ⊢ (𝐸 + 1) = 𝐶 |
| 13 | 6p5lem.6 | . . 3 ⊢ (𝐴 + 𝐷) = ;1𝐸 | |
| 14 | 9, 10, 12, 13 | decsuc 9640 | . 2 ⊢ ((𝐴 + 𝐷) + 1) = ;1𝐶 |
| 15 | 2, 8, 14 | 3eqtr2i 2258 | 1 ⊢ (𝐴 + 𝐵) = ;1𝐶 |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1397 ∈ wcel 2202 (class class class)co 6017 1c1 8032 + caddc 8034 ℕ0cn0 9401 ;cdc 9610 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-mulcom 8132 ax-addass 8133 ax-mulass 8134 ax-distr 8135 ax-i2m1 8136 ax-1rid 8138 ax-0id 8139 ax-rnegex 8140 ax-cnre 8142 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-sub 8351 df-inn 9143 df-2 9201 df-3 9202 df-4 9203 df-5 9204 df-6 9205 df-7 9206 df-8 9207 df-9 9208 df-n0 9402 df-dec 9611 |
| This theorem is referenced by: 6p5e11 9682 6p6e12 9683 7p4e11 9685 7p5e12 9686 7p6e13 9687 7p7e14 9688 8p3e11 9690 8p4e12 9691 8p5e13 9692 8p6e14 9693 8p7e15 9694 8p8e16 9695 9p2e11 9696 9p3e12 9697 9p4e13 9698 9p5e14 9699 9p6e15 9700 9p7e16 9701 9p8e17 9702 9p9e18 9703 |
| Copyright terms: Public domain | W3C validator |