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

Theorem ancoms 49
Description: Swap the two elements of a context.
Hypothesis
Ref Expression
ancoms.1 |- (R, S) |= T
Assertion
Ref Expression
ancoms |- (S, R) |= T

Proof of Theorem ancoms
StepHypRef Expression
1 ancoms.1 . . . . 5 |- (R, S) |= T
21ax-cb1 29 . . . 4 |- (R, S):*
32wctr 32 . . 3 |- S:*
42wctl 31 . . 3 |- R:*
53, 4simpr 23 . 2 |- (S, R) |= R
63, 4simpl 22 . 2 |- (S, R) |= S
75, 6, 1syl2anc 19 1 |- (S, R) |= T
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-cb1 29
This theorem is referenced by:  adantl  51  anasss  56
  Copyright terms: Public domain W3C validator