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

Theorem omword1 8500
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 6327 . . . . 5 (𝐵 ∈ On → Ord 𝐵)
2 ordgt0ge1 8420 . . . . 5 (Ord 𝐵 → (∅ ∈ 𝐵 ↔ 1o𝐵))
31, 2syl 17 . . . 4 (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ 1o𝐵))
43adantl 481 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ 1o𝐵))
5 1on 8409 . . . . . 6 1o ∈ On
6 omwordi 8498 . . . . . 6 ((1o ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ∈ On) → (1o𝐵 → (𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵)))
75, 6mp3an1 1450 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (1o𝐵 → (𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵)))
87ancoms 458 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o𝐵 → (𝐴 ·o 1o) ⊆ (𝐴 ·o 𝐵)))
9 om1 8469 . . . . . 6 (𝐴 ∈ On → (𝐴 ·o 1o) = 𝐴)
109adantr 480 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 1o) = 𝐴)
1110sseq1d 3965 . . . 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 1541  wcel 2113  wss 3901  c0 4285  Ord word 6316  Oncon0 6317  (class class class)co 7358  1oc1o 8390   ·o comu 8395
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  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 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-oadd 8401  df-omul 8402
This theorem is referenced by:  om00  8502  cantnflem3  9602  cantnflem4  9603  cnfcomlem  9610  omge1  43560  cantnftermord  43583  naddwordnexlem4  43664
  Copyright terms: Public domain W3C validator