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

Theorem oacl 6439
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 6433 . 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 2733 . . . . . . . 8  |-  w  e. 
_V
4 suceq 4387 . . . . . . . . 9  |-  ( z  =  w  ->  suc  z  =  suc  w )
5 eqid 2170 . . . . . . . . 9  |-  ( z  e.  _V  |->  suc  z
)  =  ( z  e.  _V  |->  suc  z
)
63sucex 4483 . . . . . . . . 9  |-  suc  w  e.  _V
74, 5, 6fvmpt 5573 . . . . . . . 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 2236 . . . . . 6  |-  ( ( ( z  e.  _V  |->  suc  z ) `  w
)  e.  On  <->  suc  w  e.  On )
109ralbii 2476 . . . . 5  |-  ( A. w  e.  On  (
( z  e.  _V  |->  suc  z ) `  w
)  e.  On  <->  A. w  e.  On  suc  w  e.  On )
11 suceloni 4485 . . . . 5  |-  ( w  e.  On  ->  suc  w  e.  On )
1210, 11mprgbir 2528 . . . 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 6365 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( rec ( ( z  e.  _V  |->  suc  z ) ,  A
) `  B )  e.  On )
151, 14eqeltrd 2247 1  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  e.  On )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1348    e. wcel 2141   A.wral 2448   _Vcvv 2730    |-> cmpt 4050   Oncon0 4348   suc csuc 4350   ` cfv 5198  (class class class)co 5853   reccrdg 6348    +o coa 6392
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-recs 6284  df-irdg 6349  df-oadd 6399
This theorem is referenced by:  omcl  6440  omv2  6444
  Copyright terms: Public domain W3C validator