HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem om1r 3145
Description: Ordinal multiplication with 1. Proposition 8.18(2) of [TakeutiZaring] p. 63.
Assertion
Ref Expression
om1r |- (A e. On -> (1o .o A) = A)

Proof of Theorem om1r
StepHypRef Expression
1 opreq2 3007 . . 3 |- (x = (/) -> (1o .o x) = (1o .o (/)))
2 id 9 . . 3 |- (x = (/) -> x = (/))
31, 2cleq12d 1115 . 2 |- (x = (/) -> ((1o .o x) = x <-> (1o .o (/)) = (/)))
4 opreq2 3007 . . 3 |- (x = y -> (1o .o x) = (1o .o y))
5 id 9 . . 3 |- (x = y -> x = y)
64, 5cleq12d 1115 . 2 |- (x = y -> ((1o .o x) = x <-> (1o .o y) = y))
7 opreq2 3007 . . 3 |- (x = suc y -> (1o .o x) = (1o .o suc y))
8 id 9 . . 3 |- (x = suc y -> x = suc y)
97, 8cleq12d 1115 . 2 |- (x = suc y -> ((1o .o x) = x <-> (1o .o suc y) = suc y))
10 opreq2 3007 . . 3 |- (x = A -> (1o .o x) = (1o .o A))
11 id 9 . . 3 |- (x = A -> x = A)
1210, 11cleq12d 1115 . 2 |- (x = A -> ((1o .o x) = x <-> (1o .o A) = A))
13 om0x 3126 . 2 |- (1o .o (/)) = (/)
14 1o 3109 . . . . . 6 |- 1o e. On
15 omsuc 3133 . . . . . 6 |- ((1o e. On /\ y e. On) -> (1o .o suc y) = ((1o .o y) +o 1o))
1614, 15mpan 518 . . . . 5 |- (y e. On -> (1o .o suc y) = ((1o .o y) +o 1o))
17 opreq1 3006 . . . . 5 |- ((1o .o y) = y -> ((1o .o y) +o 1o) = (y +o 1o))
1816, 17sylan9eq 1144 . . . 4 |- ((y e. On /\ (1o .o y) = y) -> (1o .o suc y) = (y +o 1o))
19 oa1suc 3132 . . . . 5 |- (y e. On -> (y +o 1o) = suc y)
2019adantr 306 . . . 4 |- ((y e. On /\ (1o .o y) = y) -> (y +o 1o) = suc y)
2118, 20eqtrd 1128 . . 3 |- ((y e. On /\ (1o .o y) = y) -> (1o .o suc y) = suc y)
2221exp 291 . 2 |- (y e. On -> ((1o .o y) = y -> (1o .o suc y) = suc y))
23 visset 1350 . . . . 5 |- x e. V
24 omlim 3136 . . . . . 6 |- ((1o e. On /\ (x e. V /\ Lim x)) -> (1o .o x) = U.y e. x (1o .o y))
2514, 24mpan 518 . . . . 5 |- ((x e. V /\ Lim x) -> (1o .o x) = U.y e. x (1o .o y))
2623, 25mpan 518 . . . 4 |- (Lim x -> (1o .o x) = U.y e. x (1o .o y))
27 limuni 2284 . . . 4 |- (Lim x -> x = U.x)
2826, 27cleq12d 1115 . . 3 |- (Lim x -> ((1o .o x) = x <-> U.y e. x (1o .o y) = U.x))
29 iuneq2 2006 . . . 4 |- (A.y e. x (1o .o y) = y -> U.y e. x (1o .o y) = U.y e. x y)
30 uniiun 2026 . . . 4 |- U.x = U.y e. x y
3129, 30syl6eqr 1142 . . 3 |- (A.y e. x (1o .o y) = y -> U.y e. x (1o .o y) = U.x)
3228, 31syl5bir 184 . 2 |- (Lim x -> (A.y e. x (1o .o y) = y -> (1o .o x) = x))
333, 6, 9, 12, 13, 22, 32tfinds 2401 1 |- (A e. On -> (1o .o A) = A)
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196   = weq 797   = wceq 1091   e. wcel 1092  A.wral 1201  Vcvv 1348  (/)c0 1707  U.cuni 1919  U.ciun 1994  Oncon0 2199  Lim wlim 2200  suc csuc 2201  (class class class)co 3001  1oc1o 3099   +o coa 3101   .o comu 3102
This theorem is referenced by:  oe1 3146
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-iun 1996  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-fv 2438  df-rdg 2970  df-opr 3003  df-oprab 3004  df-1o 3104  df-oadd 3106  df-omul 3107
metamath.org