| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nnacan | Structured version Visualization version GIF version | ||
| Description: Cancellation law for addition of natural numbers. (Contributed by NM, 27-Oct-1995.) (Revised by Mario Carneiro, 15-Nov-2014.) |
| Ref | Expression |
|---|---|
| nnacan | ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 +o 𝐵) = (𝐴 +o 𝐶) ↔ 𝐵 = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnaword 8639 | . . . . 5 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω ∧ 𝐴 ∈ ω) → (𝐵 ⊆ 𝐶 ↔ (𝐴 +o 𝐵) ⊆ (𝐴 +o 𝐶))) | |
| 2 | 1 | 3comr 1125 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐵 ⊆ 𝐶 ↔ (𝐴 +o 𝐵) ⊆ (𝐴 +o 𝐶))) |
| 3 | nnaword 8639 | . . . . 5 ⊢ ((𝐶 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (𝐶 ⊆ 𝐵 ↔ (𝐴 +o 𝐶) ⊆ (𝐴 +o 𝐵))) | |
| 4 | 3 | 3com13 1124 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 ⊆ 𝐵 ↔ (𝐴 +o 𝐶) ⊆ (𝐴 +o 𝐵))) |
| 5 | 2, 4 | anbi12d 632 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ↔ ((𝐴 +o 𝐵) ⊆ (𝐴 +o 𝐶) ∧ (𝐴 +o 𝐶) ⊆ (𝐴 +o 𝐵)))) |
| 6 | 5 | bicomd 223 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (((𝐴 +o 𝐵) ⊆ (𝐴 +o 𝐶) ∧ (𝐴 +o 𝐶) ⊆ (𝐴 +o 𝐵)) ↔ (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵))) |
| 7 | eqss 3974 | . 2 ⊢ ((𝐴 +o 𝐵) = (𝐴 +o 𝐶) ↔ ((𝐴 +o 𝐵) ⊆ (𝐴 +o 𝐶) ∧ (𝐴 +o 𝐶) ⊆ (𝐴 +o 𝐵))) | |
| 8 | eqss 3974 | . 2 ⊢ (𝐵 = 𝐶 ↔ (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵)) | |
| 9 | 6, 7, 8 | 3bitr4g 314 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 +o 𝐵) = (𝐴 +o 𝐶) ↔ 𝐵 = 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ⊆ wss 3926 (class class class)co 7405 ωcom 7861 +o coa 8477 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 ax-un 7729 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-oadd 8484 |
| This theorem is referenced by: omopthi 8673 nnasmo 8675 unfilem2 9316 ttrcltr 9730 ackbij1lem13 10245 ackbij1lem16 10248 addcanpi 10913 |
| Copyright terms: Public domain | W3C validator |