ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  oacl Unicode version

Theorem oacl 6723
Description: Closure law for ordinal addition. Proposition 8.2 of [TakeutiZaring] p. 57. (Contributed by NM, 5-May-1995.) (Constructive proof by Jim Kingdon, 26-Jul-2019.)
Assertion
Ref Expression
oacl  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  e.  On )

Proof of Theorem oacl
Dummy variables  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oav 6717 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( rec ( ( z  e. 
_V  |->  suc  z ) ,  A ) `  B
) )
2 id 19 . . 3  |-  ( A  e.  On  ->  A  e.  On )
3 vex 2824 . . . . . . . 8  |-  w  e. 
_V
4 suceq 4542 . . . . . . . . 9  |-  ( z  =  w  ->  suc  z  =  suc  w )
5 eqid 2238 . . . . . . . . 9  |-  ( z  e.  _V  |->  suc  z
)  =  ( z  e.  _V  |->  suc  z
)
63sucex 4641 . . . . . . . . 9  |-  suc  w  e.  _V
74, 5, 6fvmpt 5776 . . . . . . . 8  |-  ( w  e.  _V  ->  (
( z  e.  _V  |->  suc  z ) `  w
)  =  suc  w
)
83, 7ax-mp 5 . . . . . . 7  |-  ( ( z  e.  _V  |->  suc  z ) `  w
)  =  suc  w
98eleq1i 2304 . . . . . 6  |-  ( ( ( z  e.  _V  |->  suc  z ) `  w
)  e.  On  <->  suc  w  e.  On )
109ralbii 2556 . . . . 5  |-  ( A. w  e.  On  (
( z  e.  _V  |->  suc  z ) `  w
)  e.  On  <->  A. w  e.  On  suc  w  e.  On )
11 onsuc 4643 . . . . 5  |-  ( w  e.  On  ->  suc  w  e.  On )
1210, 11mprgbir 2608 . . . 4  |-  A. w  e.  On  ( ( z  e.  _V  |->  suc  z
) `  w )  e.  On
1312a1i 9 . . 3  |-  ( A  e.  On  ->  A. w  e.  On  ( ( z  e.  _V  |->  suc  z
) `  w )  e.  On )
142, 13rdgon 6647 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( rec ( ( z  e.  _V  |->  suc  z ) ,  A
) `  B )  e.  On )
151, 14eqeltrd 2315 1  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  e.  On )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   _Vcvv 2821    |-> cmpt 4187   Oncon0 4503   suc csuc 4505   ` cfv 5372  (class class class)co 6075   reccrdg 6630    +o coa 6674
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-recs 6566  df-irdg 6631  df-oadd 6681
This theorem is referenced by:  omcl  6724  omv2  6728
  Copyright terms: Public domain W3C validator