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

Theorem ax4 140
Description: If A is true for all x:al, then it is true for A.
Hypothesis
Ref Expression
ax4.1 |- A:*
Assertion
Ref Expression
ax4 |- (A.\x:al A) |= A

Proof of Theorem ax4
StepHypRef Expression
1 ax4.1 . . . 4 |- A:*
21wl 59 . . 3 |- \x:al A:(al -> *)
3 wv 58 . . 3 |- x:al:al
42, 3ax4g 139 . 2 |- (A.\x:al A) |= (\x:al Ax:al)
54ax-cb1 29 . . 3 |- (A.\x:al A):*
61beta 82 . . 3 |- T. |= [(\x:al Ax:al) = A]
75, 6a1i 28 . 2 |- (A.\x:al A) |= [(\x:al Ax:al) = A]
84, 7mpbi 72 1 |- (A.\x:al A) |= A
Colors of variables: type var term
Syntax hints:  tv 1  *hb 3  kc 5  \kl 6   = ke 7  [kbr 9   |= wffMMJ2 11  wffMMJ2t 12  A.tal 112
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-ded 43  ax-ceq 46  ax-beta 60  ax-distrc 61  ax-leq 62  ax-hbl1 93  ax-17 95  ax-inst 103
This theorem depends on definitions:  df-ov 65  df-al 116
This theorem is referenced by:  alimdv  172  alnex  174  ax5  194  ax7  196  ax10  200  axext  206
  Copyright terms: Public domain W3C validator