| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > naddss2 | Structured version Visualization version GIF version | ||
| Description: Ordinal less-than-or-equal is not affected by natural addition. (Contributed by Scott Fenton, 9-Sep-2024.) |
| Ref | Expression |
|---|---|
| naddss2 | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐶 +no 𝐴) ⊆ (𝐶 +no 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | naddss1 8604 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 +no 𝐶) ⊆ (𝐵 +no 𝐶))) | |
| 2 | naddcom 8597 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐴 +no 𝐶) = (𝐶 +no 𝐴)) | |
| 3 | 2 | 3adant2 1131 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 +no 𝐶) = (𝐶 +no 𝐴)) |
| 4 | naddcom 8597 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 +no 𝐶) = (𝐶 +no 𝐵)) | |
| 5 | 4 | 3adant1 1130 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 +no 𝐶) = (𝐶 +no 𝐵)) |
| 6 | 3, 5 | sseq12d 3963 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 +no 𝐶) ⊆ (𝐵 +no 𝐶) ↔ (𝐶 +no 𝐴) ⊆ (𝐶 +no 𝐵))) |
| 7 | 1, 6 | bitrd 279 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐶 +no 𝐴) ⊆ (𝐶 +no 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ⊆ wss 3897 Oncon0 6306 (class class class)co 7346 +no cnadd 8580 |
| 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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 |
| 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 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4896 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-se 5568 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 6248 df-ord 6309 df-on 6310 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-ov 7349 df-oprab 7350 df-mpo 7351 df-1st 7921 df-2nd 7922 df-frecs 8211 df-nadd 8581 |
| This theorem is referenced by: naddword1 8606 naddunif 8608 mulsproplem14 28068 naddgeoa 43497 |
| Copyright terms: Public domain | W3C validator |