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

Theorem oeicl 6695
Description: Closure law for ordinal exponentiation. (Contributed by Jim Kingdon, 26-Jul-2019.)
Assertion
Ref Expression
oeicl  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( Ao  B )  e.  On )

Proof of Theorem oeicl
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oeiv 6689 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( Ao  B )  =  ( rec ( ( x  e.  _V  |->  ( x  .o  A ) ) ,  1o ) `  B ) )
2 1on 6654 . . . 4  |-  1o  e.  On
32a1i 9 . . 3  |-  ( A  e.  On  ->  1o  e.  On )
4 vex 2816 . . . . . . 7  |-  y  e. 
_V
5 omcl 6694 . . . . . . 7  |-  ( ( y  e.  On  /\  A  e.  On )  ->  ( y  .o  A
)  e.  On )
6 oveq1 6057 . . . . . . . 8  |-  ( x  =  y  ->  (
x  .o  A )  =  ( y  .o  A ) )
7 eqid 2232 . . . . . . . 8  |-  ( x  e.  _V  |->  ( x  .o  A ) )  =  ( x  e. 
_V  |->  ( x  .o  A ) )
86, 7fvmptg 5753 . . . . . . 7  |-  ( ( y  e.  _V  /\  ( y  .o  A
)  e.  On )  ->  ( ( x  e.  _V  |->  ( x  .o  A ) ) `
 y )  =  ( y  .o  A
) )
94, 5, 8sylancr 414 . . . . . 6  |-  ( ( y  e.  On  /\  A  e.  On )  ->  ( ( x  e. 
_V  |->  ( x  .o  A ) ) `  y )  =  ( y  .o  A ) )
109, 5eqeltrd 2309 . . . . 5  |-  ( ( y  e.  On  /\  A  e.  On )  ->  ( ( x  e. 
_V  |->  ( x  .o  A ) ) `  y )  e.  On )
1110ancoms 268 . . . 4  |-  ( ( A  e.  On  /\  y  e.  On )  ->  ( ( x  e. 
_V  |->  ( x  .o  A ) ) `  y )  e.  On )
1211ralrimiva 2615 . . 3  |-  ( A  e.  On  ->  A. y  e.  On  ( ( x  e.  _V  |->  ( x  .o  A ) ) `
 y )  e.  On )
133, 12rdgon 6617 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( rec ( ( x  e.  _V  |->  ( x  .o  A ) ) ,  1o ) `
 B )  e.  On )
141, 13eqeltrd 2309 1  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( Ao  B )  e.  On )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203   _Vcvv 2813    |-> cmpt 4171   Oncon0 4484   ` cfv 5352  (class class class)co 6050   reccrdg 6600   1oc1o 6640    .o comu 6645   ↑o coei 6646
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-irdg 6601  df-1o 6647  df-oadd 6651  df-omul 6652  df-oexpi 6653
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator