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

Theorem omword1 8508
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 6333 . . . . 5 (𝐵 ∈ On → Ord 𝐵)
2 ordgt0ge1 8428 . . . . 5 (Ord 𝐵 → (∅ ∈ 𝐵 ↔ 1o𝐵))
31, 2syl 17 . . . 4 (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ 1o𝐵))
43adantl 481 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ 1o𝐵))
5 1on 8417 . . . . . 6 1o ∈ On
6 omwordi 8506 . . . . . 6 ((1o ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ∈ On) → (1o𝐵 → (𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵)))
75, 6mp3an1 1451 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (1o𝐵 → (𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵)))
87ancoms 458 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o𝐵 → (𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵)))
9 om1 8477 . . . . . 6 (𝐴 ∈ On → (𝐴 ·o 1o) = 𝐴)
109adantr 480 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 1o) = 𝐴)
1110sseq1d 3953 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵) ↔ 𝐴 ⊆ (𝐴 ·o 𝐵)))
128, 11sylibd 239 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o𝐵𝐴 ⊆ (𝐴 ·o 𝐵)))
134, 12sylbid 240 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵𝐴 ⊆ (𝐴 ·o 𝐵)))
1413imp 406 1 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ ∅ ∈ 𝐵) → 𝐴 ⊆ (𝐴 ·o 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wss 3889  c0 4273  Ord word 6322  Oncon0 6323  (class class class)co 7367  1oc1o 8398   ·o comu 8403
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-oadd 8409  df-omul 8410
This theorem is referenced by:  om00  8510  cantnflem3  9612  cantnflem4  9613  cnfcomlem  9620  omge1  43725  cantnftermord  43748  naddwordnexlem4  43829
  Copyright terms: Public domain W3C validator