| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > omord2lim | Structured version Visualization version GIF version | ||
| Description: Given a limit ordinal, the product of any nonzero ordinal with an ordinal less than that limit ordinal is less than the product of the nonzero ordinal with the limit ordinal . Lemma 3.14 of [Schloeder] p. 9. (Contributed by RP, 29-Jan-2025.) |
| Ref | Expression |
|---|---|
| omord2lim | ⊢ (((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) → (𝐵 ∈ 𝐶 → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | limord 6424 | . . . . 5 ⊢ (Lim 𝐶 → Ord 𝐶) | |
| 2 | 1 | ad2antrl 741 | . . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) → Ord 𝐶) |
| 3 | ordelon 6386 | . . . 4 ⊢ ((Ord 𝐶 ∧ 𝐵 ∈ 𝐶) → 𝐵 ∈ On) | |
| 4 | 2, 3 | sylan 592 | . . 3 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → 𝐵 ∈ On) |
| 5 | elex 3471 | . . . . . 6 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 6 | 1, 5 | anim12i 625 | . . . . 5 ⊢ ((Lim 𝐶 ∧ 𝐶 ∈ 𝑉) → (Ord 𝐶 ∧ 𝐶 ∈ V)) |
| 7 | 6 | ad2antlr 740 | . . . 4 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → (Ord 𝐶 ∧ 𝐶 ∈ V)) |
| 8 | elon2 6373 | . . . 4 ⊢ (𝐶 ∈ On ↔ (Ord 𝐶 ∧ 𝐶 ∈ V)) | |
| 9 | 7, 8 | sylibr 237 | . . 3 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → 𝐶 ∈ On) |
| 10 | simplll 787 | . . 3 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → 𝐴 ∈ On) | |
| 11 | simpr 490 | . . 3 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → 𝐵 ∈ 𝐶) | |
| 12 | on0eln0 6420 | . . . . 5 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 13 | 12 | biimpar 483 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≠ ∅) → ∅ ∈ 𝐴) |
| 14 | 13 | ad2antrr 739 | . . 3 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → ∅ ∈ 𝐴) |
| 15 | omord 8576 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On ∧ 𝐴 ∈ On) → ((𝐵 ∈ 𝐶 ∧ ∅ ∈ 𝐴) ↔ (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶))) | |
| 16 | 15 | biimpa 482 | . . 3 ⊢ (((𝐵 ∈ On ∧ 𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐵 ∈ 𝐶 ∧ ∅ ∈ 𝐴)) → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶)) |
| 17 | 4, 9, 10, 11, 14, 16 | syl32anc 1405 | . 2 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶)) |
| 18 | 17 | ex 418 | 1 ⊢ (((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) → (𝐵 ∈ 𝐶 → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2144 ≠ wne 2955 Vcvv 3450 ∅c0 4278 Ord word 6361 Oncon0 6362 Lim wlim 6363 (class class class)co 7420 ·o comu 8474 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 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 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-oadd 8480 df-omul 8481 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |