| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addnidpig | GIF version | ||
| Description: There is no identity element for addition on positive integers. (Contributed by NM, 28-Nov-1995.) |
| Ref | Expression |
|---|---|
| addnidpig | ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ¬ (𝐴 +N 𝐵) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pinn 7507 | . . 3 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
| 2 | elni2 7512 | . . . 4 ⊢ (𝐵 ∈ N ↔ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) | |
| 3 | nnaordi 6662 | . . . . . . 7 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (∅ ∈ 𝐵 → (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) | |
| 4 | nna0 6628 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ω → (𝐴 +o ∅) = 𝐴) | |
| 5 | 4 | eleq1d 2298 | . . . . . . . . 9 ⊢ (𝐴 ∈ ω → ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) ↔ 𝐴 ∈ (𝐴 +o 𝐵))) |
| 6 | nnord 4704 | . . . . . . . . . . . 12 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 7 | ordirr 4634 | . . . . . . . . . . . 12 ⊢ (Ord 𝐴 → ¬ 𝐴 ∈ 𝐴) | |
| 8 | 6, 7 | syl 14 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ ω → ¬ 𝐴 ∈ 𝐴) |
| 9 | eleq2 2293 | . . . . . . . . . . . 12 ⊢ ((𝐴 +o 𝐵) = 𝐴 → (𝐴 ∈ (𝐴 +o 𝐵) ↔ 𝐴 ∈ 𝐴)) | |
| 10 | 9 | notbid 671 | . . . . . . . . . . 11 ⊢ ((𝐴 +o 𝐵) = 𝐴 → (¬ 𝐴 ∈ (𝐴 +o 𝐵) ↔ ¬ 𝐴 ∈ 𝐴)) |
| 11 | 8, 10 | syl5ibrcom 157 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ω → ((𝐴 +o 𝐵) = 𝐴 → ¬ 𝐴 ∈ (𝐴 +o 𝐵))) |
| 12 | 11 | con2d 627 | . . . . . . . . 9 ⊢ (𝐴 ∈ ω → (𝐴 ∈ (𝐴 +o 𝐵) → ¬ (𝐴 +o 𝐵) = 𝐴)) |
| 13 | 5, 12 | sylbid 150 | . . . . . . . 8 ⊢ (𝐴 ∈ ω → ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → ¬ (𝐴 +o 𝐵) = 𝐴)) |
| 14 | 13 | adantl 277 | . . . . . . 7 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → ¬ (𝐴 +o 𝐵) = 𝐴)) |
| 15 | 3, 14 | syld 45 | . . . . . 6 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (∅ ∈ 𝐵 → ¬ (𝐴 +o 𝐵) = 𝐴)) |
| 16 | 15 | expcom 116 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐵 ∈ ω → (∅ ∈ 𝐵 → ¬ (𝐴 +o 𝐵) = 𝐴))) |
| 17 | 16 | imp32 257 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) → ¬ (𝐴 +o 𝐵) = 𝐴) |
| 18 | 2, 17 | sylan2b 287 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → ¬ (𝐴 +o 𝐵) = 𝐴) |
| 19 | 1, 18 | sylan 283 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ¬ (𝐴 +o 𝐵) = 𝐴) |
| 20 | addpiord 7514 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +N 𝐵) = (𝐴 +o 𝐵)) | |
| 21 | 20 | eqeq1d 2238 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ((𝐴 +N 𝐵) = 𝐴 ↔ (𝐴 +o 𝐵) = 𝐴)) |
| 22 | 19, 21 | mtbird 677 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ¬ (𝐴 +N 𝐵) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ∅c0 3491 Ord word 4453 ωcom 4682 (class class class)co 6007 +o coa 6565 Ncnpi 7470 +N cpli 7471 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-iord 4457 df-on 4459 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-irdg 6522 df-oadd 6572 df-ni 7502 df-pli 7503 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |