| 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 6423 | . . . . 5 ⊢ (Lim 𝐶 → Ord 𝐶) | |
| 2 | 1 | ad2antrl 741 | . . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) → Ord 𝐶) |
| 3 | ordelon 6385 | . . . 4 ⊢ ((Ord 𝐶 ∧ 𝐵 ∈ 𝐶) → 𝐵 ∈ On) | |
| 4 | 2, 3 | sylan 592 | . . 3 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → 𝐵 ∈ On) |
| 5 | elex 3474 | . . . . . 6 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 6 | 1, 5 | anim12i 625 | . . . . 5 ⊢ ((Lim 𝐶 ∧ 𝐶 ∈ 𝑉) → (Ord 𝐶 ∧ 𝐶 ∈ V)) |
| 7 | 6 | ad2antlr 740 | . . . 4 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → (Ord 𝐶 ∧ 𝐶 ∈ V)) |
| 8 | elon2 6372 | . . . 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 6419 | . . . . 5 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 13 | 12 | biimpar 483 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≠ ∅) → ∅ ∈ 𝐴) |
| 14 | 13 | ad2antrr 739 | . . 3 ⊢ ((((𝐴 ∈ On ∧ 𝐴 ≠ ∅) ∧ (Lim 𝐶 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ∈ 𝐶) → ∅ ∈ 𝐴) |
| 15 | omord 8558 | . . . 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 2145 ≠ wne 2957 Vcvv 3453 ∅c0 4282 Ord word 6360 Oncon0 6361 Lim wlim 6362 (class class class)co 7416 ·o comu 8456 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7739 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-oadd 8462 df-omul 8463 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |