| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oeword | Structured version Visualization version GIF version | ||
| Description: Weak ordering property of ordinal exponentiation. (Contributed by NM, 6-Jan-2005.) (Revised by Mario Carneiro, 24-May-2015.) |
| Ref | Expression |
|---|---|
| oeword | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 ↔ (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oeord 8518 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ∈ 𝐵 ↔ (𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵))) | |
| 2 | oecan 8519 | . . . . 5 ⊢ ((𝐶 ∈ (On ∖ 2o) ∧ 𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵) ↔ 𝐴 = 𝐵)) | |
| 3 | 2 | 3coml 1134 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵) ↔ 𝐴 = 𝐵)) |
| 4 | 3 | bicomd 225 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 = 𝐵 ↔ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵))) |
| 5 | 1, 4 | orbi12d 925 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 6 | onsseleq 6354 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
| 7 | 6 | 3adant3 1139 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| 8 | eldifi 4063 | . . . 4 ⊢ (𝐶 ∈ (On ∖ 2o) → 𝐶 ∈ On) | |
| 9 | id 22 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ On ∧ 𝐵 ∈ On)) | |
| 10 | oecl 8466 | . . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → (𝐶 ↑o 𝐴) ∈ On) | |
| 11 | oecl 8466 | . . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ↑o 𝐵) ∈ On) | |
| 12 | 10, 11 | anim12dan 626 | . . . . 5 ⊢ ((𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)) → ((𝐶 ↑o 𝐴) ∈ On ∧ (𝐶 ↑o 𝐵) ∈ On)) |
| 13 | onsseleq 6354 | . . . . 5 ⊢ (((𝐶 ↑o 𝐴) ∈ On ∧ (𝐶 ↑o 𝐵) ∈ On) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) | |
| 14 | 12, 13 | syl 17 | . . . 4 ⊢ ((𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 15 | 8, 9, 14 | syl2anr 604 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 16 | 15 | 3impa 1116 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 17 | 5, 7, 16 | 3bitr4d 313 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 ↔ (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∨ wo 854 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ∖ cdif 3881 ⊆ wss 3884 Oncon0 6313 (class class class)co 7359 2oc2o 8393 ↑o coe 8398 |
| 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 5201 ax-sep 5220 ax-nul 5230 ax-pr 5364 ax-un 7681 |
| 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 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-omul 8404 df-oexp 8405 |
| This theorem is referenced by: oewordi 8521 cantnftermord 43778 omabs2 43790 |
| Copyright terms: Public domain | W3C validator |