| 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 8575 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ∈ 𝐵 ↔ (𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵))) | |
| 2 | oecan 8576 | . . . . 5 ⊢ ((𝐶 ∈ (On ∖ 2o) ∧ 𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵) ↔ 𝐴 = 𝐵)) | |
| 3 | 2 | 3coml 1145 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵) ↔ 𝐴 = 𝐵)) |
| 4 | 3 | bicomd 226 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 = 𝐵 ↔ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵))) |
| 5 | 1, 4 | orbi12d 932 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 6 | onsseleq 6393 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
| 7 | 6 | 3adant3 1150 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| 8 | eldifi 4077 | . . . 4 ⊢ (𝐶 ∈ (On ∖ 2o) → 𝐶 ∈ On) | |
| 9 | id 23 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ On ∧ 𝐵 ∈ On)) | |
| 10 | oecl 8523 | . . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → (𝐶 ↑o 𝐴) ∈ On) | |
| 11 | oecl 8523 | . . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ↑o 𝐵) ∈ On) | |
| 12 | 10, 11 | anim12dan 631 | . . . . 5 ⊢ ((𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)) → ((𝐶 ↑o 𝐴) ∈ On ∧ (𝐶 ↑o 𝐵) ∈ On)) |
| 13 | onsseleq 6393 | . . . . 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 609 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ (On ∖ 2o)) → ((𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵) ↔ ((𝐶 ↑o 𝐴) ∈ (𝐶 ↑o 𝐵) ∨ (𝐶 ↑o 𝐴) = (𝐶 ↑o 𝐵)))) |
| 16 | 15 | 3impa 1127 | . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∖ cdif 3895 ⊆ wss 3898 Oncon0 6351 (class class class)co 7408 2oc2o 8448 ↑o coe 8453 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7861 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8454 df-2o 8455 df-oadd 8458 df-omul 8459 df-oexp 8460 |
| This theorem is used by: oewordi 8578 cantnftermord 44265 omabs2 44277 |
| Copyright terms: Public domain | W3C validator |