![]() |
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 7141 | . . 3 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
2 | elni2 7146 | . . . 4 ⊢ (𝐵 ∈ N ↔ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) | |
3 | nnaordi 6412 | . . . . . . 7 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (∅ ∈ 𝐵 → (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) | |
4 | nna0 6378 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ω → (𝐴 +o ∅) = 𝐴) | |
5 | 4 | eleq1d 2209 | . . . . . . . . 9 ⊢ (𝐴 ∈ ω → ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) ↔ 𝐴 ∈ (𝐴 +o 𝐵))) |
6 | nnord 4533 | . . . . . . . . . . . 12 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
7 | ordirr 4465 | . . . . . . . . . . . 12 ⊢ (Ord 𝐴 → ¬ 𝐴 ∈ 𝐴) | |
8 | 6, 7 | syl 14 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ ω → ¬ 𝐴 ∈ 𝐴) |
9 | eleq2 2204 | . . . . . . . . . . . 12 ⊢ ((𝐴 +o 𝐵) = 𝐴 → (𝐴 ∈ (𝐴 +o 𝐵) ↔ 𝐴 ∈ 𝐴)) | |
10 | 9 | notbid 657 | . . . . . . . . . . 11 ⊢ ((𝐴 +o 𝐵) = 𝐴 → (¬ 𝐴 ∈ (𝐴 +o 𝐵) ↔ ¬ 𝐴 ∈ 𝐴)) |
11 | 8, 10 | syl5ibrcom 156 | . . . . . . . . . 10 ⊢ (𝐴 ∈ ω → ((𝐴 +o 𝐵) = 𝐴 → ¬ 𝐴 ∈ (𝐴 +o 𝐵))) |
12 | 11 | con2d 614 | . . . . . . . . 9 ⊢ (𝐴 ∈ ω → (𝐴 ∈ (𝐴 +o 𝐵) → ¬ (𝐴 +o 𝐵) = 𝐴)) |
13 | 5, 12 | sylbid 149 | . . . . . . . 8 ⊢ (𝐴 ∈ ω → ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → ¬ (𝐴 +o 𝐵) = 𝐴)) |
14 | 13 | adantl 275 | . . . . . . 7 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → ¬ (𝐴 +o 𝐵) = 𝐴)) |
15 | 3, 14 | syld 45 | . . . . . 6 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (∅ ∈ 𝐵 → ¬ (𝐴 +o 𝐵) = 𝐴)) |
16 | 15 | expcom 115 | . . . . 5 ⊢ (𝐴 ∈ ω → (𝐵 ∈ ω → (∅ ∈ 𝐵 → ¬ (𝐴 +o 𝐵) = 𝐴))) |
17 | 16 | imp32 255 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) → ¬ (𝐴 +o 𝐵) = 𝐴) |
18 | 2, 17 | sylan2b 285 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → ¬ (𝐴 +o 𝐵) = 𝐴) |
19 | 1, 18 | sylan 281 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ¬ (𝐴 +o 𝐵) = 𝐴) |
20 | addpiord 7148 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +N 𝐵) = (𝐴 +o 𝐵)) | |
21 | 20 | eqeq1d 2149 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ((𝐴 +N 𝐵) = 𝐴 ↔ (𝐴 +o 𝐵) = 𝐴)) |
22 | 19, 21 | mtbird 663 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → ¬ (𝐴 +N 𝐵) = 𝐴) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 = wceq 1332 ∈ wcel 1481 ∅c0 3368 Ord word 4292 ωcom 4512 (class class class)co 5782 +o coa 6318 Ncnpi 7104 +N cpli 7105 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-coll 4051 ax-sep 4054 ax-nul 4062 ax-pow 4106 ax-pr 4139 ax-un 4363 ax-setind 4460 ax-iinf 4510 |
This theorem depends on definitions: df-bi 116 df-dc 821 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-ral 2422 df-rex 2423 df-reu 2424 df-rab 2426 df-v 2691 df-sbc 2914 df-csb 3008 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-nul 3369 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-int 3780 df-iun 3823 df-br 3938 df-opab 3998 df-mpt 3999 df-tr 4035 df-id 4223 df-iord 4296 df-on 4298 df-suc 4301 df-iom 4513 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-res 4559 df-ima 4560 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-f1 5136 df-fo 5137 df-f1o 5138 df-fv 5139 df-ov 5785 df-oprab 5786 df-mpo 5787 df-1st 6046 df-2nd 6047 df-recs 6210 df-irdg 6275 df-oadd 6325 df-ni 7136 df-pli 7137 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |