| 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 6439 | . . . . 5 ⊢ (Lim 𝐶 → Ord 𝐶) | |
| 2 | 1 | ad2antrl 741 | . . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) → Ord 𝐶) |
| 3 | ordelon 6401 | . . . 4 ⊢ ((Ord 𝐶 ∧ 𝐵 ∈ 𝐶) → 𝐵 ∈ On) | |
| 4 | 2, 3 | sylan 592 | . . 3 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → 𝐵 ∈ On) |
| 5 | elex 3475 | . . . . . 6 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 6 | 1, 5 | anim12i 625 | . . . . 5 ⊢ ((Lim 𝐶 ∧ 𝐶 ∈ 𝑉) → (Ord 𝐶 ∧ 𝐶 ∈ V)) |
| 7 | 6 | ad2antlr 740 | . . . 4 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → (Ord 𝐶 ∧ 𝐶 ∈ V)) |
| 8 | elon2 6388 | . . . 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 6435 | . . . . 5 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 13 | 12 | biimpar 483 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≠ ∅) → ∅ ∈ 𝐴) |
| 14 | 13 | ad2antrr 739 | . . 3 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → ∅ ∈ 𝐴) |
| 15 | omord 8601 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On ∧ 𝐴 ∈ On) → ((𝐵 ∈ 𝐶 ∧ ∅ ∈ 𝐴) ↔ (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶))) | |
| 16 | 15 | biimpa 482 | . . 3 ⊢ (((𝐵 ∈ On ∧ 𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐵 ∈ 𝐶 ∧ ∅ ∈ 𝐴)) → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶)) |
| 17 | 4, 9, 10, 11, 14, 16 | syl32anc 1406 | . 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 2147 ≠ wne 2959 Vcvv 3454 ∅c0 4281 Ord word 6376 Oncon0 6377 Lim wlim 6378 (class class class)co 7440 ·o comu 8499 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7772 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-oadd 8505 df-omul 8506 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |