| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nnarcl | Structured version Visualization version GIF version | ||
| Description: Reverse closure law for addition of natural numbers. Exercise 1 of [TakeutiZaring] p. 62 and its converse. (Contributed by NM, 12-Dec-2004.) |
| Ref | Expression |
|---|---|
| nnarcl | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∈ ω ↔ (𝐴 ∈ ω ∧ 𝐵 ∈ ω))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oaword1 8462 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ⊆ (𝐴 +o 𝐵)) | |
| 2 | eloni 6312 | . . . . . . 7 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 3 | ordom 7801 | . . . . . . 7 ⊢ Ord ω | |
| 4 | ordtr2 6347 | . . . . . . 7 ⊢ ((Ord 𝐴 ∧ Ord ω) → ((𝐴 ⊆ (𝐴 +o 𝐵) ∧ (𝐴 +o 𝐵) ∈ ω) → 𝐴 ∈ ω)) | |
| 5 | 2, 3, 4 | sylancl 586 | . . . . . 6 ⊢ (𝐴 ∈ On → ((𝐴 ⊆ (𝐴 +o 𝐵) ∧ (𝐴 +o 𝐵) ∈ ω) → 𝐴 ∈ ω)) |
| 6 | 5 | expd 415 | . . . . 5 ⊢ (𝐴 ∈ On → (𝐴 ⊆ (𝐴 +o 𝐵) → ((𝐴 +o 𝐵) ∈ ω → 𝐴 ∈ ω))) |
| 7 | 6 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ (𝐴 +o 𝐵) → ((𝐴 +o 𝐵) ∈ ω → 𝐴 ∈ ω))) |
| 8 | 1, 7 | mpd 15 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∈ ω → 𝐴 ∈ ω)) |
| 9 | oaword2 8463 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → 𝐵 ⊆ (𝐴 +o 𝐵)) | |
| 10 | 9 | ancoms 458 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ⊆ (𝐴 +o 𝐵)) |
| 11 | eloni 6312 | . . . . . . 7 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 12 | ordtr2 6347 | . . . . . . 7 ⊢ ((Ord 𝐵 ∧ Ord ω) → ((𝐵 ⊆ (𝐴 +o 𝐵) ∧ (𝐴 +o 𝐵) ∈ ω) → 𝐵 ∈ ω)) | |
| 13 | 11, 3, 12 | sylancl 586 | . . . . . 6 ⊢ (𝐵 ∈ On → ((𝐵 ⊆ (𝐴 +o 𝐵) ∧ (𝐴 +o 𝐵) ∈ ω) → 𝐵 ∈ ω)) |
| 14 | 13 | expd 415 | . . . . 5 ⊢ (𝐵 ∈ On → (𝐵 ⊆ (𝐴 +o 𝐵) → ((𝐴 +o 𝐵) ∈ ω → 𝐵 ∈ ω))) |
| 15 | 14 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ⊆ (𝐴 +o 𝐵) → ((𝐴 +o 𝐵) ∈ ω → 𝐵 ∈ ω))) |
| 16 | 10, 15 | mpd 15 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∈ ω → 𝐵 ∈ ω)) |
| 17 | 8, 16 | jcad 512 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∈ ω → (𝐴 ∈ ω ∧ 𝐵 ∈ ω))) |
| 18 | nnacl 8521 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω) | |
| 19 | 17, 18 | impbid1 225 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∈ ω ↔ (𝐴 ∈ ω ∧ 𝐵 ∈ ω))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2110 ⊆ wss 3900 Ord word 6301 Oncon0 6302 (class class class)co 7341 ωcom 7791 +o coa 8377 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pr 5368 ax-un 7663 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-oadd 8384 |
| This theorem is referenced by: fineqvnttrclselem1 35109 finxpreclem4 37407 |
| Copyright terms: Public domain | W3C validator |