MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  omword1 Structured version   Visualization version   GIF version

Theorem omword1 8595
Description: An ordinal is less than or equal to its product with another. Lemma 3.11 of [Schloeder] p. 8. (Contributed by NM, 21-Dec-2004.)
Assertion
Ref Expression
omword1 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ ∅ ∈ 𝐵) → 𝐴 ⊆ (𝐴 ·o 𝐵))

Proof of Theorem omword1
StepHypRef Expression
1 eloni 6379 . . . . 5 (𝐵 ∈ On → Ord 𝐵)
2 ordgt0ge1 8515 . . . . 5 (Ord 𝐵 → (∅ ∈ 𝐵 ↔ 1o ⊆ 𝐵))
31, 2syl 18 . . . 4 (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ 1o ⊆ 𝐵))
43adantl 487 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ 1o ⊆ 𝐵))
5 1on 8503 . . . . . 6 1o ∈ On
6 omwordi 8593 . . . . . 6 ((1o ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ∈ On) → (1o ⊆ 𝐵 → (𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵)))
75, 6mp3an1 1477 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (1o ⊆ 𝐵 → (𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵)))
87ancoms 464 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ⊆ 𝐵 → (𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵)))
9 om1 8564 . . . . . 6 (𝐴 ∈ On → (𝐴 ·o 1o) = 𝐴)
109adantr 486 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 1o) = 𝐴)
1110sseq1d 3944 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵) ↔ 𝐴 ⊆ (𝐴 ·o 𝐵)))
128, 11sylibd 242 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ⊆ 𝐵 → 𝐴 ⊆ (𝐴 ·o 𝐵)))
134, 12sylbid 243 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 → 𝐴 ⊆ (𝐴 ·o 𝐵)))
1413imp 412 1 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ ∅ ∈ 𝐵) → 𝐴 ⊆ (𝐴 ·o 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146   ⊆ wss 3900  ∅c0 4281  Ord word 6368  Oncon0 6369  (class class class)co 7430  1oc1o 8483   ·o comu 8488
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761
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 2101  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 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-1o 8490  df-oadd 8494  df-omul 8495
This theorem is used by:  om00  8597  cantnflem3  9705  cantnflem4  9706  cnfcomlem  9713  omge1  44442  cantnftermord  44465  naddwordnexlem4  44546
  Copyright terms: Public domain W3C validator