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

Theorem om1r 8152
Description: Ordinal multiplication with 1. Proposition 8.18(2) of [TakeutiZaring] p. 63. (Contributed by NM, 3-Aug-2004.)
Assertion
Ref Expression
om1r (𝐴 ∈ On → (1o ·o 𝐴) = 𝐴)

Proof of Theorem om1r
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 7143 . . 3 (𝑥 = ∅ → (1o ·o 𝑥) = (1o ·o ∅))
2 id 22 . . 3 (𝑥 = ∅ → 𝑥 = ∅)
31, 2eqeq12d 2814 . 2 (𝑥 = ∅ → ((1o ·o 𝑥) = 𝑥 ↔ (1o ·o ∅) = ∅))
4 oveq2 7143 . . 3 (𝑥 = 𝑦 → (1o ·o 𝑥) = (1o ·o 𝑦))
5 id 22 . . 3 (𝑥 = 𝑦𝑥 = 𝑦)
64, 5eqeq12d 2814 . 2 (𝑥 = 𝑦 → ((1o ·o 𝑥) = 𝑥 ↔ (1o ·o 𝑦) = 𝑦))
7 oveq2 7143 . . 3 (𝑥 = suc 𝑦 → (1o ·o 𝑥) = (1o ·o suc 𝑦))
8 id 22 . . 3 (𝑥 = suc 𝑦𝑥 = suc 𝑦)
97, 8eqeq12d 2814 . 2 (𝑥 = suc 𝑦 → ((1o ·o 𝑥) = 𝑥 ↔ (1o ·o suc 𝑦) = suc 𝑦))
10 oveq2 7143 . . 3 (𝑥 = 𝐴 → (1o ·o 𝑥) = (1o ·o 𝐴))
11 id 22 . . 3 (𝑥 = 𝐴𝑥 = 𝐴)
1210, 11eqeq12d 2814 . 2 (𝑥 = 𝐴 → ((1o ·o 𝑥) = 𝑥 ↔ (1o ·o 𝐴) = 𝐴))
13 1on 8092 . . 3 1o ∈ On
14 om0 8125 . . 3 (1o ∈ On → (1o ·o ∅) = ∅)
1513, 14ax-mp 5 . 2 (1o ·o ∅) = ∅
16 omsuc 8134 . . . . . 6 ((1o ∈ On ∧ 𝑦 ∈ On) → (1o ·o suc 𝑦) = ((1o ·o 𝑦) +o 1o))
1713, 16mpan 689 . . . . 5 (𝑦 ∈ On → (1o ·o suc 𝑦) = ((1o ·o 𝑦) +o 1o))
18 oveq1 7142 . . . . 5 ((1o ·o 𝑦) = 𝑦 → ((1o ·o 𝑦) +o 1o) = (𝑦 +o 1o))
1917, 18sylan9eq 2853 . . . 4 ((𝑦 ∈ On ∧ (1o ·o 𝑦) = 𝑦) → (1o ·o suc 𝑦) = (𝑦 +o 1o))
20 oa1suc 8139 . . . . 5 (𝑦 ∈ On → (𝑦 +o 1o) = suc 𝑦)
2120adantr 484 . . . 4 ((𝑦 ∈ On ∧ (1o ·o 𝑦) = 𝑦) → (𝑦 +o 1o) = suc 𝑦)
2219, 21eqtrd 2833 . . 3 ((𝑦 ∈ On ∧ (1o ·o 𝑦) = 𝑦) → (1o ·o suc 𝑦) = suc 𝑦)
2322ex 416 . 2 (𝑦 ∈ On → ((1o ·o 𝑦) = 𝑦 → (1o ·o suc 𝑦) = suc 𝑦))
24 iuneq2 4900 . . . 4 (∀𝑦𝑥 (1o ·o 𝑦) = 𝑦 𝑦𝑥 (1o ·o 𝑦) = 𝑦𝑥 𝑦)
25 uniiun 4945 . . . 4 𝑥 = 𝑦𝑥 𝑦
2624, 25eqtr4di 2851 . . 3 (∀𝑦𝑥 (1o ·o 𝑦) = 𝑦 𝑦𝑥 (1o ·o 𝑦) = 𝑥)
27 vex 3444 . . . . 5 𝑥 ∈ V
28 omlim 8141 . . . . . 6 ((1o ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (1o ·o 𝑥) = 𝑦𝑥 (1o ·o 𝑦))
2913, 28mpan 689 . . . . 5 ((𝑥 ∈ V ∧ Lim 𝑥) → (1o ·o 𝑥) = 𝑦𝑥 (1o ·o 𝑦))
3027, 29mpan 689 . . . 4 (Lim 𝑥 → (1o ·o 𝑥) = 𝑦𝑥 (1o ·o 𝑦))
31 limuni 6219 . . . 4 (Lim 𝑥𝑥 = 𝑥)
3230, 31eqeq12d 2814 . . 3 (Lim 𝑥 → ((1o ·o 𝑥) = 𝑥 𝑦𝑥 (1o ·o 𝑦) = 𝑥))
3326, 32syl5ibr 249 . 2 (Lim 𝑥 → (∀𝑦𝑥 (1o ·o 𝑦) = 𝑦 → (1o ·o 𝑥) = 𝑥))
343, 6, 9, 12, 15, 23, 33tfinds 7554 1 (𝐴 ∈ On → (1o ·o 𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2111  wral 3106  Vcvv 3441  c0 4243   cuni 4800   ciun 4881  Oncon0 6159  Lim wlim 6160  suc csuc 6161  (class class class)co 7135  1oc1o 8078   +o coa 8082   ·o comu 8083
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-omul 8090
This theorem is referenced by:  oe1  8153  omword2  8183
  Copyright terms: Public domain W3C validator