![]() |
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 8588 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ⊆ (𝐴 +o 𝐵)) | |
2 | eloni 6395 | . . . . . . 7 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
3 | ordom 7896 | . . . . . . 7 ⊢ Ord ω | |
4 | ordtr2 6429 | . . . . . . 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 8589 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → 𝐵 ⊆ (𝐴 +o 𝐵)) | |
10 | 9 | ancoms 458 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ⊆ (𝐴 +o 𝐵)) |
11 | eloni 6395 | . . . . . . 7 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
12 | ordtr2 6429 | . . . . . . 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 8647 | . 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 2105 ⊆ wss 3962 Ord word 6384 Oncon0 6385 (class class class)co 7430 ωcom 7886 +o coa 8501 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pr 5437 ax-un 7753 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-ral 3059 df-rex 3068 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-oadd 8508 |
This theorem is referenced by: finxpreclem4 37376 |
Copyright terms: Public domain | W3C validator |