![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nnaword | Structured version Visualization version GIF version |
Description: Weak ordering property of addition. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.) |
Ref | Expression |
---|---|
nnaword | ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐶 +𝑜 𝐴) ⊆ (𝐶 +𝑜 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnaord 7744 | . . . 4 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐶 ∈ ω) → (𝐵 ∈ 𝐴 ↔ (𝐶 +𝑜 𝐵) ∈ (𝐶 +𝑜 𝐴))) | |
2 | 1 | 3com12 1288 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐵 ∈ 𝐴 ↔ (𝐶 +𝑜 𝐵) ∈ (𝐶 +𝑜 𝐴))) |
3 | 2 | notbid 307 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (¬ 𝐵 ∈ 𝐴 ↔ ¬ (𝐶 +𝑜 𝐵) ∈ (𝐶 +𝑜 𝐴))) |
4 | nnord 7115 | . . . 4 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
5 | nnord 7115 | . . . 4 ⊢ (𝐵 ∈ ω → Ord 𝐵) | |
6 | ordtri1 5794 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) | |
7 | 4, 5, 6 | syl2an 493 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) |
8 | 7 | 3adant3 1101 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) |
9 | nnacl 7736 | . . . . 5 ⊢ ((𝐶 ∈ ω ∧ 𝐴 ∈ ω) → (𝐶 +𝑜 𝐴) ∈ ω) | |
10 | 9 | ancoms 468 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 +𝑜 𝐴) ∈ ω) |
11 | 10 | 3adant2 1100 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 +𝑜 𝐴) ∈ ω) |
12 | nnacl 7736 | . . . . 5 ⊢ ((𝐶 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 +𝑜 𝐵) ∈ ω) | |
13 | 12 | ancoms 468 | . . . 4 ⊢ ((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 +𝑜 𝐵) ∈ ω) |
14 | 13 | 3adant1 1099 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐶 +𝑜 𝐵) ∈ ω) |
15 | nnord 7115 | . . . 4 ⊢ ((𝐶 +𝑜 𝐴) ∈ ω → Ord (𝐶 +𝑜 𝐴)) | |
16 | nnord 7115 | . . . 4 ⊢ ((𝐶 +𝑜 𝐵) ∈ ω → Ord (𝐶 +𝑜 𝐵)) | |
17 | ordtri1 5794 | . . . 4 ⊢ ((Ord (𝐶 +𝑜 𝐴) ∧ Ord (𝐶 +𝑜 𝐵)) → ((𝐶 +𝑜 𝐴) ⊆ (𝐶 +𝑜 𝐵) ↔ ¬ (𝐶 +𝑜 𝐵) ∈ (𝐶 +𝑜 𝐴))) | |
18 | 15, 16, 17 | syl2an 493 | . . 3 ⊢ (((𝐶 +𝑜 𝐴) ∈ ω ∧ (𝐶 +𝑜 𝐵) ∈ ω) → ((𝐶 +𝑜 𝐴) ⊆ (𝐶 +𝑜 𝐵) ↔ ¬ (𝐶 +𝑜 𝐵) ∈ (𝐶 +𝑜 𝐴))) |
19 | 11, 14, 18 | syl2anc 694 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐶 +𝑜 𝐴) ⊆ (𝐶 +𝑜 𝐵) ↔ ¬ (𝐶 +𝑜 𝐵) ∈ (𝐶 +𝑜 𝐴))) |
20 | 3, 8, 19 | 3bitr4d 300 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐶 +𝑜 𝐴) ⊆ (𝐶 +𝑜 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ w3a 1054 ∈ wcel 2030 ⊆ wss 3607 Ord word 5760 (class class class)co 6690 ωcom 7107 +𝑜 coa 7602 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-reu 2948 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-ov 6693 df-oprab 6694 df-mpt2 6695 df-om 7108 df-wrecs 7452 df-recs 7513 df-rdg 7551 df-oadd 7609 |
This theorem is referenced by: nnacan 7753 nnaword1 7754 |
Copyright terms: Public domain | W3C validator |