| 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 8516 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ∈ 𝐵 ↔ (𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵))) | |
| 2 | oecan 8517 | . . . . 5 ⊢ ((𝐶 ∈ (On ∖ 2o) ∧ 𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵) ↔ 𝐴 = 𝐵)) | |
| 3 | 2 | 3coml 1128 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵) ↔ 𝐴 = 𝐵)) |
| 4 | 3 | bicomd 223 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 = 𝐵 ↔ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵))) |
| 5 | 1, 4 | orbi12d 919 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 6 | onsseleq 6357 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
| 7 | 6 | 3adant3 1133 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| 8 | eldifi 4082 | . . . 4 ⊢ (𝐶 ∈ (On ∖ 2o) → 𝐶 ∈ On) | |
| 9 | id 22 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ On ∧ 𝐵 ∈ On)) | |
| 10 | oecl 8464 | . . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → (𝐶 ↑o 𝐴) ∈ On) | |
| 11 | oecl 8464 | . . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ↑o 𝐵) ∈ On) | |
| 12 | 10, 11 | anim12dan 620 | . . . . 5 ⊢ ((𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)) → ((𝐶 ↑o 𝐴) ∈ On ∧ (𝐶 ↑o 𝐵) ∈ On)) |
| 13 | onsseleq 6357 | . . . . 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 598 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 16 | 15 | 3impa 1110 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 17 | 5, 7, 16 | 3bitr4d 311 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 ↔ (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∖ cdif 3897 ⊆ wss 3900 Oncon0 6316 (class class class)co 7358 2oc2o 8391 ↑o coe 8396 |
| 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 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pr 5376 ax-un 7680 |
| 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 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-oadd 8401 df-omul 8402 df-oexp 8403 |
| This theorem is referenced by: oewordi 8519 cantnftermord 43599 omabs2 43611 |
| Copyright terms: Public domain | W3C validator |