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

Theorem anasss 56
Description: Associativity for context.
Hypothesis
Ref Expression
an32s.1 |- ((R, S), T) |= A
Assertion
Ref Expression
anasss |- (R, (S, T)) |= A

Proof of Theorem anasss
StepHypRef Expression
1 an32s.1 . . . . . . . 8 |- ((R, S), T) |= A
21ax-cb1 29 . . . . . . 7 |- ((R, S), T):*
32wctl 31 . . . . . 6 |- (R, S):*
43id 25 . . . . 5 |- (R, S) |= (R, S)
54ancoms 49 . . . 4 |- (S, R) |= (R, S)
65, 1sylan 54 . . 3 |- ((S, R), T) |= A
76an32s 55 . 2 |- ((S, T), R) |= A
87ancoms 49 1 |- (R, (S, T)) |= A
Colors of variables: type var term
Syntax hints:  kct 10   |= wffMMJ2 11
This theorem was proved from axioms:  ax-syl 15  ax-jca 17  ax-simpl 20  ax-simpr 21  ax-id 24  ax-cb1 29
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator