HOLE Home Higher-Order Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HOLE Home  >  Th. List  >  ovl Unicode version

Theorem ovl 107
Description: Evaluate a lambda expression in a binary operation.
Hypotheses
Ref Expression
ovl.1 |- A:ga
ovl.2 |- S:al
ovl.3 |- T:be
ovl.4 |- [x:al = S] |= [A = B]
ovl.5 |- [y:be = T] |= [B = C]
Assertion
Ref Expression
ovl |- T. |= [[S\x:al \y:be AT] = C]
Distinct variable groups:   x,B   y,C   x,y,S   y,T   al,x   be,y

Proof of Theorem ovl
StepHypRef Expression
1 ovl.1 . . . . 5 |- A:ga
21wl 59 . . . 4 |- \y:be A:(be -> ga)
32wl 59 . . 3 |- \x:al \y:be A:(al -> (be -> ga))
4 ovl.2 . . 3 |- S:al
5 ovl.3 . . 3 |- T:be
63, 4, 5wov 64 . 2 |- [S\x:al \y:be AT]:ga
7 weq 38 . . . 4 |- = :(ga -> (ga -> *))
83, 4wc 45 . . . . 5 |- (\x:al \y:be AS):(be -> ga)
98, 5wc 45 . . . 4 |- ((\x:al \y:be AS)T):ga
10 wtru 40 . . . . 5 |- T.:*
113, 4, 5df-ov 65 . . . . 5 |- T. |= (( = [S\x:al \y:be AT])((\x:al \y:be AS)T))
1210, 11a1i 28 . . . 4 |- T. |= (( = [S\x:al \y:be AT])((\x:al \y:be AS)T))
137, 6, 9, 12dfov2 67 . . 3 |- T. |= [[S\x:al \y:be AT] = ((\x:al \y:be AS)T)]
141, 4distrl 84 . . . . 5 |- T. |= [(\x:al \y:be AS) = \y:be (\x:al AS)]
1510, 14a1i 28 . . . 4 |- T. |= [(\x:al \y:be AS) = \y:be (\x:al AS)]
168, 5, 15ceq1 79 . . 3 |- T. |= [((\x:al \y:be AS)T) = (\y:be (\x:al AS)T)]
176, 13, 16eqtri 85 . 2 |- T. |= [[S\x:al \y:be AT] = (\y:be (\x:al AS)T)]
181wl 59 . . . 4 |- \x:al A:(al -> ga)
1918, 4wc 45 . . 3 |- (\x:al AS):ga
20 wv 58 . . . . . 6 |- y:be:be
2120, 5weqi 68 . . . . 5 |- [y:be = T]:*
22 ovl.4 . . . . . 6 |- [x:al = S] |= [A = B]
231, 4, 22cl 106 . . . . 5 |- T. |= [(\x:al AS) = B]
2421, 23a1i 28 . . . 4 |- [y:be = T] |= [(\x:al AS) = B]
25 ovl.5 . . . 4 |- [y:be = T] |= [B = C]
2619, 24, 25eqtri 85 . . 3 |- [y:be = T] |= [(\x:al AS) = C]
2719, 5, 26cl 106 . 2 |- T. |= [(\y:be (\x:al AS)T) = C]
286, 17, 27eqtri 85 1 |- T. |= [[S\x:al \y:be AT] = C]
Colors of variables: type var term
Syntax hints:  tv 1   -> ht 2  kc 5  \kl 6   = ke 7  T.kt 8  [kbr 9   |= wffMMJ2 11  wffMMJ2t 12
This theorem was proved from axioms:  ax-syl 15  ax-jca 17  ax-simpl 20  ax-simpr 21  ax-id 24  ax-trud 26  ax-cb1 29  ax-cb2 30  ax-refl 39  ax-eqmp 42  ax-ceq 46  ax-beta 60  ax-distrc 61  ax-leq 62  ax-distrl 63  ax-hbl1 93  ax-17 95  ax-inst 103
This theorem depends on definitions:  df-ov 65
This theorem is referenced by:  imval  136  orval  137  anval  138  dfan2  144
  Copyright terms: Public domain W3C validator