Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nna0r | Structured version Visualization version GIF version |
Description: Addition to zero. Remark in proof of Theorem 4K(2) of [Enderton] p. 81. Note: In this and later theorems, we deliberately avoid the more general ordinal versions of these theorems (in this case oa0r 8166) so that we can avoid ax-rep 5193, which is not needed for finite recursive definitions. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 14-Nov-2014.) |
Ref | Expression |
---|---|
nna0r | ⊢ (𝐴 ∈ ω → (∅ +o 𝐴) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq2 7167 | . . 3 ⊢ (𝑥 = ∅ → (∅ +o 𝑥) = (∅ +o ∅)) | |
2 | id 22 | . . 3 ⊢ (𝑥 = ∅ → 𝑥 = ∅) | |
3 | 1, 2 | eqeq12d 2840 | . 2 ⊢ (𝑥 = ∅ → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o ∅) = ∅)) |
4 | oveq2 7167 | . . 3 ⊢ (𝑥 = 𝑦 → (∅ +o 𝑥) = (∅ +o 𝑦)) | |
5 | id 22 | . . 3 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦) | |
6 | 4, 5 | eqeq12d 2840 | . 2 ⊢ (𝑥 = 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝑦) = 𝑦)) |
7 | oveq2 7167 | . . 3 ⊢ (𝑥 = suc 𝑦 → (∅ +o 𝑥) = (∅ +o suc 𝑦)) | |
8 | id 22 | . . 3 ⊢ (𝑥 = suc 𝑦 → 𝑥 = suc 𝑦) | |
9 | 7, 8 | eqeq12d 2840 | . 2 ⊢ (𝑥 = suc 𝑦 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o suc 𝑦) = suc 𝑦)) |
10 | oveq2 7167 | . . 3 ⊢ (𝑥 = 𝐴 → (∅ +o 𝑥) = (∅ +o 𝐴)) | |
11 | id 22 | . . 3 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴) | |
12 | 10, 11 | eqeq12d 2840 | . 2 ⊢ (𝑥 = 𝐴 → ((∅ +o 𝑥) = 𝑥 ↔ (∅ +o 𝐴) = 𝐴)) |
13 | 0elon 6247 | . . 3 ⊢ ∅ ∈ On | |
14 | oa0 8144 | . . 3 ⊢ (∅ ∈ On → (∅ +o ∅) = ∅) | |
15 | 13, 14 | ax-mp 5 | . 2 ⊢ (∅ +o ∅) = ∅ |
16 | peano1 7604 | . . . 4 ⊢ ∅ ∈ ω | |
17 | nnasuc 8235 | . . . 4 ⊢ ((∅ ∈ ω ∧ 𝑦 ∈ ω) → (∅ +o suc 𝑦) = suc (∅ +o 𝑦)) | |
18 | 16, 17 | mpan 688 | . . 3 ⊢ (𝑦 ∈ ω → (∅ +o suc 𝑦) = suc (∅ +o 𝑦)) |
19 | suceq 6259 | . . . 4 ⊢ ((∅ +o 𝑦) = 𝑦 → suc (∅ +o 𝑦) = suc 𝑦) | |
20 | 19 | eqeq2d 2835 | . . 3 ⊢ ((∅ +o 𝑦) = 𝑦 → ((∅ +o suc 𝑦) = suc (∅ +o 𝑦) ↔ (∅ +o suc 𝑦) = suc 𝑦)) |
21 | 18, 20 | syl5ibcom 247 | . 2 ⊢ (𝑦 ∈ ω → ((∅ +o 𝑦) = 𝑦 → (∅ +o suc 𝑦) = suc 𝑦)) |
22 | 3, 6, 9, 12, 15, 21 | finds 7611 | 1 ⊢ (𝐴 ∈ ω → (∅ +o 𝐴) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1536 ∈ wcel 2113 ∅c0 4294 Oncon0 6194 suc csuc 6196 (class class class)co 7159 ωcom 7583 +o coa 8102 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-oadd 8109 |
This theorem is referenced by: nnacom 8246 nnm1 8278 |
Copyright terms: Public domain | W3C validator |