| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > omwordi | Structured version Visualization version GIF version | ||
| Description: Weak ordering property of ordinal multiplication. (Contributed by NM, 21-Dec-2004.) |
| Ref | Expression |
|---|---|
| omwordi | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | omword 8499 | . . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴 ⊆ 𝐵 ↔ (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))) | |
| 2 | 1 | biimpd 229 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))) |
| 3 | 2 | ex 412 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))) |
| 4 | eloni 6328 | . . . . . 6 ⊢ (𝐶 ∈ On → Ord 𝐶) | |
| 5 | ord0eln0 6374 | . . . . . . 7 ⊢ (Ord 𝐶 → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅)) | |
| 6 | 5 | necon2bbid 2976 | . . . . . 6 ⊢ (Ord 𝐶 → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶)) |
| 7 | 4, 6 | syl 17 | . . . . 5 ⊢ (𝐶 ∈ On → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶)) |
| 8 | 7 | 3ad2ant3 1136 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐶 = ∅ ↔ ¬ ∅ ∈ 𝐶)) |
| 9 | ssid 3945 | . . . . . . 7 ⊢ ∅ ⊆ ∅ | |
| 10 | om0r 8468 | . . . . . . . . 9 ⊢ (𝐴 ∈ On → (∅ ·o 𝐴) = ∅) | |
| 11 | 10 | adantr 480 | . . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐴) = ∅) |
| 12 | om0r 8468 | . . . . . . . . 9 ⊢ (𝐵 ∈ On → (∅ ·o 𝐵) = ∅) | |
| 13 | 12 | adantl 481 | . . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐵) = ∅) |
| 14 | 11, 13 | sseq12d 3956 | . . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((∅ ·o 𝐴) ⊆ (∅ ·o 𝐵) ↔ ∅ ⊆ ∅)) |
| 15 | 9, 14 | mpbiri 258 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ·o 𝐴) ⊆ (∅ ·o 𝐵)) |
| 16 | oveq1 7368 | . . . . . . 7 ⊢ (𝐶 = ∅ → (𝐶 ·o 𝐴) = (∅ ·o 𝐴)) | |
| 17 | oveq1 7368 | . . . . . . 7 ⊢ (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵)) | |
| 18 | 16, 17 | sseq12d 3956 | . . . . . 6 ⊢ (𝐶 = ∅ → ((𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵) ↔ (∅ ·o 𝐴) ⊆ (∅ ·o 𝐵))) |
| 19 | 15, 18 | syl5ibrcom 247 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 = ∅ → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))) |
| 20 | 19 | 3adant3 1133 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐶 = ∅ → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))) |
| 21 | 8, 20 | sylbird 260 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ ∅ ∈ 𝐶 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))) |
| 22 | 21 | a1dd 50 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ ∅ ∈ 𝐶 → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))) |
| 23 | 3, 22 | pm2.61d 179 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ⊆ 𝐵 → (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ⊆ wss 3890 ∅c0 4274 Ord word 6317 Oncon0 6318 (class class class)co 7361 ·o comu 8397 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-oadd 8403 df-omul 8404 |
| This theorem is referenced by: omword1 8502 omass 8509 omeulem1 8511 oewordri 8522 oeoalem 8526 oeeui 8532 oaabs2 8579 omxpenlem 9010 cantnflt 9587 cantnflem1d 9603 omabs2 43781 naddwordnexlem0 43845 oaltom 43853 |
| Copyright terms: Public domain | W3C validator |