| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > omord | Structured version Visualization version GIF version | ||
| Description: Ordering property of ordinal multiplication. Proposition 8.19 of [TakeutiZaring] p. 63. Theorem 3.16 of [Schloeder] p. 9. (Contributed by NM, 14-Dec-2004.) |
| Ref | Expression |
|---|---|
| omord | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | omord2 8496 | . . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴 ∈ 𝐵 ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))) | |
| 2 | 1 | ex 414 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 → (𝐴 ∈ 𝐵 ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))) |
| 3 | 2 | pm5.32rd 584 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶))) |
| 4 | simpl 484 | . . 3 ⊢ (((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶) → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)) | |
| 5 | ne0i 4272 | . . . . . . . 8 ⊢ ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → (𝐶 ·o 𝐵) ≠ ∅) | |
| 6 | om0r 8468 | . . . . . . . . . 10 ⊢ (𝐵 ∈ On → (∅ ·o 𝐵) = ∅) | |
| 7 | oveq1 7367 | . . . . . . . . . . 11 ⊢ (𝐶 = ∅ → (𝐶 ·o 𝐵) = (∅ ·o 𝐵)) | |
| 8 | 7 | eqeq1d 2743 | . . . . . . . . . 10 ⊢ (𝐶 = ∅ → ((𝐶 ·o 𝐵) = ∅ ↔ (∅ ·o 𝐵) = ∅)) |
| 9 | 6, 8 | syl5ibrcom 249 | . . . . . . . . 9 ⊢ (𝐵 ∈ On → (𝐶 = ∅ → (𝐶 ·o 𝐵) = ∅)) |
| 10 | 9 | necon3d 2957 | . . . . . . . 8 ⊢ (𝐵 ∈ On → ((𝐶 ·o 𝐵) ≠ ∅ → 𝐶 ≠ ∅)) |
| 11 | 5, 10 | syl5 34 | . . . . . . 7 ⊢ (𝐵 ∈ On → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅)) |
| 12 | 11 | adantr 482 | . . . . . 6 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → 𝐶 ≠ ∅)) |
| 13 | on0eln0 6371 | . . . . . . 7 ⊢ (𝐶 ∈ On → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅)) | |
| 14 | 13 | adantl 483 | . . . . . 6 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 ↔ 𝐶 ≠ ∅)) |
| 15 | 12, 14 | sylibrd 261 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶)) |
| 16 | 15 | 3adant1 1137 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ∅ ∈ 𝐶)) |
| 17 | 16 | ancld 556 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) → ((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶))) |
| 18 | 4, 17 | impbid2 228 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (((𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵) ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))) |
| 19 | 3, 18 | bitrd 281 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ≠ wne 2936 ∅c0 4264 Oncon0 6314 (class class class)co 7360 ·o comu 8397 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pr 5365 ax-un 7682 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-oadd 8403 df-omul 8404 |
| This theorem is referenced by: omlimcl 8507 oneo 8510 omord2lim 43760 omord2com 43762 |
| Copyright terms: Public domain | W3C validator |