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

Theorem imval 136
Description: Value of the implication.
Hypotheses
Ref Expression
imval.1 A:∗
imval.2 B:∗
Assertion
Ref Expression
imval ⊤⊧[[AB] = [[A B] = A]]

Proof of Theorem imval
Dummy variables p q are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 wim 127 . . 3 ⇒ :(∗ → (∗ → ∗))
2 imval.1 . . 3 A:∗
3 imval.2 . . 3 B:∗
41, 2, 3wov 64 . 2 [AB]:∗
5 df-im 119 . . 3 ⊤⊧[ ⇒ = λp:∗ λq:∗ [[p:∗ q:∗] = p:∗]]
61, 2, 3, 5oveq 92 . 2 ⊤⊧[[AB] = [Aλp:∗ λq:∗ [[p:∗ q:∗] = p:∗]B]]
7 wan 126 . . . . 5 :(∗ → (∗ → ∗))
8 wv 58 . . . . 5 p:∗:∗
9 wv 58 . . . . 5 q:∗:∗
107, 8, 9wov 64 . . . 4 [p:∗ q:∗]:∗
1110, 8weqi 68 . . 3 [[p:∗ q:∗] = p:∗]:∗
12 weq 38 . . . 4 = :(∗ → (∗ → ∗))
138, 2weqi 68 . . . . . 6 [p:∗ = A]:∗
1413id 25 . . . . 5 [p:∗ = A]⊧[p:∗ = A]
157, 8, 9, 14oveq1 89 . . . 4 [p:∗ = A]⊧[[p:∗ q:∗] = [A q:∗]]
1612, 10, 8, 15, 14oveq12 90 . . 3 [p:∗ = A]⊧[[[p:∗ q:∗] = p:∗] = [[A q:∗] = A]]
177, 2, 9wov 64 . . . 4 [A q:∗]:∗
189, 3weqi 68 . . . . . 6 [q:∗ = B]:∗
1918id 25 . . . . 5 [q:∗ = B]⊧[q:∗ = B]
207, 2, 9, 19oveq2 91 . . . 4 [q:∗ = B]⊧[[A q:∗] = [A B]]
2112, 17, 2, 20oveq1 89 . . 3 [q:∗ = B]⊧[[[A q:∗] = A] = [[A B] = A]]
2211, 2, 3, 16, 21ovl 107 . 2 ⊤⊧[[Aλp:∗ λq:∗ [[p:∗ q:∗] = p:∗]B] = [[A B] = A]]
234, 6, 22eqtri 85 1 ⊤⊧[[AB] = [[A B] = A]]
Colors of variables: type var term
Syntax hints:  tv 1  hb 3  λkl 6   = ke 7  kt 8  [kbr 9  wffMMJ2 11  wffMMJ2t 12   tan 109  tim 111
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  df-an 118  df-im 119
This theorem is referenced by:  mpd  146  ex  148
  Copyright terms: Public domain W3C validator