| 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 8573 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ∈ 𝐵 ↔ (𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵))) | |
| 2 | oecan 8574 | . . . . 5 ⊢ ((𝐶 ∈ (On ∖ 2o) ∧ 𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵) ↔ 𝐴 = 𝐵)) | |
| 3 | 2 | 3coml 1143 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵) ↔ 𝐴 = 𝐵)) |
| 4 | 3 | bicomd 226 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 = 𝐵 ↔ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵))) |
| 5 | 1, 4 | orbi12d 931 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 6 | onsseleq 6402 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
| 7 | 6 | 3adant3 1148 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| 8 | eldifi 4084 | . . . 4 ⊢ (𝐶 ∈ (On ∖ 2o) → 𝐶 ∈ On) | |
| 9 | id 23 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ On ∧ 𝐵 ∈ On)) | |
| 10 | oecl 8521 | . . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → (𝐶 ↑o 𝐴) ∈ On) | |
| 11 | oecl 8521 | . . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ↑o 𝐵) ∈ On) | |
| 12 | 10, 11 | anim12dan 630 | . . . . 5 ⊢ ((𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)) → ((𝐶 ↑o 𝐴) ∈ On ∧ (𝐶 ↑o 𝐵) ∈ On)) |
| 13 | onsseleq 6402 | . . . . 5 ⊢ (((𝐶 ↑o 𝐴) ∈ On ∧ (𝐶 ↑o 𝐵) ∈ On) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ ((𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 15 | 8, 9, 14 | syl2anr 608 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 16 | 15 | 3impa 1125 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 17 | 5, 7, 16 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 ↔ (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∧ w3a 1101 = wceq 1568 ∈ wcel 2141 ∖ cdif 3901 ⊆ wss 3904 Oncon0 6360 (class class class)co 7410 2oc2o 8446 ↑o coe 8451 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-oadd 8456 df-omul 8457 df-oexp 8458 |
| This theorem is referenced by: oewordi 8576 cantnftermord 43995 omabs2 44007 |
| Copyright terms: Public domain | W3C validator |