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

Theorem ax5 194
Description: Axiom of Quantified Implication. Axiom C4 of [Monk2] p. 105.
Hypotheses
Ref Expression
ax5.1 |- R:*
ax5.2 |- S:*
Assertion
Ref Expression
ax5 |- T. |= [(A.\x:al [R ==> S]) ==> [(A.\x:al R) ==> (A.\x:al S)]]
Distinct variable group:   al,x

Proof of Theorem ax5
Dummy variable y is distinct from all other variables.
StepHypRef Expression
1 ax5.2 . . . . . 6 |- S:*
2 ax5.1 . . . . . . . 8 |- R:*
32ax4 140 . . . . . . 7 |- (A.\x:al R) |= R
4 wal 124 . . . . . . . 8 |- A.:((al -> *) -> *)
5 wim 127 . . . . . . . . . 10 |- ==> :(* -> (* -> *))
65, 2, 1wov 64 . . . . . . . . 9 |- [R ==> S]:*
76wl 59 . . . . . . . 8 |- \x:al [R ==> S]:(al -> *)
84, 7wc 45 . . . . . . 7 |- (A.\x:al [R ==> S]):*
93, 8adantl 51 . . . . . 6 |- ((A.\x:al [R ==> S]), (A.\x:al R)) |= R
106ax4 140 . . . . . . 7 |- (A.\x:al [R ==> S]) |= [R ==> S]
113ax-cb1 29 . . . . . . 7 |- (A.\x:al R):*
1210, 11adantr 50 . . . . . 6 |- ((A.\x:al [R ==> S]), (A.\x:al R)) |= [R ==> S]
131, 9, 12mpd 146 . . . . 5 |- ((A.\x:al [R ==> S]), (A.\x:al R)) |= S
14 wv 58 . . . . . 6 |- y:al:al
154, 14ax-17 95 . . . . . . 7 |- T. |= [(\x:al A.y:al) = A.]
166, 14ax-hbl1 93 . . . . . . 7 |- T. |= [(\x:al \x:al [R ==> S]y:al) = \x:al [R ==> S]]
174, 7, 14, 15, 16hbc 100 . . . . . 6 |- T. |= [(\x:al (A.\x:al [R ==> S])y:al) = (A.\x:al [R ==> S])]
182wl 59 . . . . . . 7 |- \x:al R:(al -> *)
192, 14ax-hbl1 93 . . . . . . 7 |- T. |= [(\x:al \x:al Ry:al) = \x:al R]
204, 18, 14, 15, 19hbc 100 . . . . . 6 |- T. |= [(\x:al (A.\x:al R)y:al) = (A.\x:al R)]
218, 14, 11, 17, 20hbct 145 . . . . 5 |- T. |= [(\x:al ((A.\x:al [R ==> S]), (A.\x:al R))y:al) = ((A.\x:al [R ==> S]), (A.\x:al R))]
2213, 21alrimi 170 . . . 4 |- ((A.\x:al [R ==> S]), (A.\x:al R)) |= (A.\x:al S)
2322ex 148 . . 3 |- (A.\x:al [R ==> S]) |= [(A.\x:al R) ==> (A.\x:al S)]
24 wtru 40 . . 3 |- T.:*
2523, 24adantl 51 . 2 |- (T., (A.\x:al [R ==> S])) |= [(A.\x:al R) ==> (A.\x:al S)]
2625ex 148 1 |- T. |= [(A.\x:al [R ==> S]) ==> [(A.\x:al R) ==> (A.\x:al S)]]
Colors of variables: type var term
Syntax hints:  tv 1   -> ht 2  *hb 3  kc 5  \kl 6  T.kt 8  [kbr 9  kct 10   |= wffMMJ2 11  wffMMJ2t 12   ==> tim 111  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-distrl 63  ax-hbl1 93  ax-17 95  ax-inst 103  ax-eta 165
This theorem depends on definitions:  df-ov 65  df-al 116  df-an 118  df-im 119
This theorem is referenced by:  ax11  201
  Copyright terms: Public domain W3C validator