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

Theorem ax4e 158
Description: Existential introduction.
Hypotheses
Ref Expression
ax4e.1 |- F:(al -> *)
ax4e.2 |- A:al
Assertion
Ref Expression
ax4e |- (FA) |= (E.F)

Proof of Theorem ax4e
Dummy variables x p are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 wv 58 . . . . 5 |- p:*:*
2 ax4e.1 . . . . . . 7 |- F:(al -> *)
3 ax4e.2 . . . . . . 7 |- A:al
42, 3wc 45 . . . . . 6 |- (FA):*
5 wal 124 . . . . . . 7 |- A.:((al -> *) -> *)
6 wim 127 . . . . . . . . 9 |- ==> :(* -> (* -> *))
7 wv 58 . . . . . . . . . 10 |- x:al:al
82, 7wc 45 . . . . . . . . 9 |- (Fx:al):*
96, 8, 1wov 64 . . . . . . . 8 |- [(Fx:al) ==> p:*]:*
109wl 59 . . . . . . 7 |- \x:al [(Fx:al) ==> p:*]:(al -> *)
115, 10wc 45 . . . . . 6 |- (A.\x:al [(Fx:al) ==> p:*]):*
124, 11simpl 22 . . . . 5 |- ((FA), (A.\x:al [(Fx:al) ==> p:*])) |= (FA)
137, 3weqi 68 . . . . . . . . . 10 |- [x:al = A]:*
1413id 25 . . . . . . . . 9 |- [x:al = A] |= [x:al = A]
152, 7, 14ceq2 80 . . . . . . . 8 |- [x:al = A] |= [(Fx:al) = (FA)]
166, 8, 1, 15oveq1 89 . . . . . . 7 |- [x:al = A] |= [[(Fx:al) ==> p:*] = [(FA) ==> p:*]]
179, 3, 16cla4v 142 . . . . . 6 |- (A.\x:al [(Fx:al) ==> p:*]) |= [(FA) ==> p:*]
1817, 4adantl 51 . . . . 5 |- ((FA), (A.\x:al [(Fx:al) ==> p:*])) |= [(FA) ==> p:*]
191, 12, 18mpd 146 . . . 4 |- ((FA), (A.\x:al [(Fx:al) ==> p:*])) |= p:*
2019ex 148 . . 3 |- (FA) |= [(A.\x:al [(Fx:al) ==> p:*]) ==> p:*]
2120alrimiv 141 . 2 |- (FA) |= (A.\p:* [(A.\x:al [(Fx:al) ==> p:*]) ==> p:*])
222exval 133 . . 3 |- T. |= [(E.F) = (A.\p:* [(A.\x:al [(Fx:al) ==> p:*]) ==> p:*])]
234, 22a1i 28 . 2 |- (FA) |= [(E.F) = (A.\p:* [(A.\x:al [(Fx:al) ==> p:*]) ==> p:*])]
2421, 23mpbir 77 1 |- (FA) |= (E.F)
Colors of variables: type var term
Syntax hints:  tv 1   -> ht 2  *hb 3  kc 5  \kl 6   = ke 7  [kbr 9  kct 10   |= wffMMJ2 11  wffMMJ2t 12   ==> tim 111  A.tal 112  E.tex 113
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-distrl 63  ax-hbl1 93  ax-17 95  ax-inst 103
This theorem depends on definitions:  df-ov 65  df-al 116  df-an 118  df-im 119  df-ex 121
This theorem is referenced by:  cla4ev  159  19.8a  160  dfex2  185  axrep  207
  Copyright terms: Public domain W3C validator