Kdtyjb

Why are the trig functions versine, haversine, exsecant, etc, rarely used in modern mathematics?

Dating a Former Employee

How do I find out the mythology and history of my Fortress?

Can a party unilaterally change candidates in preparation for a General election?

Why wasn't DOSKEY integrated with COMMAND.COM?

When the Haste spell ends on a creature, do attackers have advantage against that creature?

Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied?

An adverb for when you're not exaggerating

Can you use the Shield Master feat to shove someone before you make an attack by using a Readied action?

How come Sam didn't become Lord of Horn Hill?

What do you call the main part of a joke?

What's the meaning of "fortified infraction restraint"?

Where are Serre’s lectures at Collège de France to be found?

How do I make this wiring inside cabinet safer? (Pic)

Should I use a zero-interest credit card for a large one-time purchase?

First console to have temporary backward compatibility

Does classifying an integer as a discrete log require it be part of a multiplicative group?

Why didn't Eitri join the fight?

Can melee weapons be used to deliver Contact Poisons?

Withdrew £2800, but only £2000 shows as withdrawn on online banking; what are my obligations?

How to react to hostile behavior from a senior developer?

Most bit efficient text communication method?

Would "destroying" Wurmcoil Engine prevent its tokens from being created?

What is the longest distance a player character can jump in one leap?

Bussproofs compact prooftree

0

I have the following code:

begin{prooftree}

    AxiomC{$Gamma $}

    AxiomC{}

    LeftLabel{($to$-elim)}

    BinaryInfC{$Gamma , x : A, y : C vdash x y Leftarrow D$}

    AxiomC{}

    LeftLabel{($equiv_{mathsf{type}}$-refl)}

    UnaryInfC{$Gamma , x : A, y : C vdash D equiv D$}

    LeftLabel{(switch)}

    BinaryInfC{$Gamma , x : A , y : C vdash xy Rightarrow D$}

    LeftLabel{($to$-intro)}

    UnaryInfC{$Gamma , x : A vdash lamba y . x y Leftarrow C to D$}

    AxiomC{}

    LeftLabel{$(**)$}

    UnaryInfC{$Gamma , x : A vdash B equiv C to D  mathsf{type}$}

    LeftLabel{(switch)}

    BinaryInfC{$ Gamma , x : A vdash lambda y . xy Rightarrow B$}

    LeftLabel{($to$-intro)}

    UnaryInfC{$Gamma vdash lambda x . lambda y . x y Leftarrow A to B$}

    AxiomC{}

    RightLabel{$(*)$}

    UnaryInfC{$Gamma vdash T equiv A to B  mathsf{type}$}

    RightLabel{(switch)}

    BinaryInfC{$Gamma vdash lambda x . lambda y . x y Rightarrow T$}

end{prooftree}

Which gives me the following tree:

Is there a way I can get rid of the whitespace in the middle? Where (*) and (**) take place it would be nice to slide them under the tree. I don't think this is possible in bussproofs from what I have read but I could be wrong.

For example if there is a local horizontal spacing when I do a BinaryInfC that I could change that might let me squish them together.

horizontal-alignment bussproofs

share

asked 4 mins ago

Ali CaglayanAli Caglayan

238137

add a comment | 

0

I have the following code:

begin{prooftree}

    AxiomC{$Gamma $}

    AxiomC{}

    LeftLabel{($to$-elim)}

    BinaryInfC{$Gamma , x : A, y : C vdash x y Leftarrow D$}

    AxiomC{}

    LeftLabel{($equiv_{mathsf{type}}$-refl)}

    UnaryInfC{$Gamma , x : A, y : C vdash D equiv D$}

    LeftLabel{(switch)}

    BinaryInfC{$Gamma , x : A , y : C vdash xy Rightarrow D$}

    LeftLabel{($to$-intro)}

    UnaryInfC{$Gamma , x : A vdash lamba y . x y Leftarrow C to D$}

    AxiomC{}

    LeftLabel{$(**)$}

    UnaryInfC{$Gamma , x : A vdash B equiv C to D  mathsf{type}$}

    LeftLabel{(switch)}

    BinaryInfC{$ Gamma , x : A vdash lambda y . xy Rightarrow B$}

    LeftLabel{($to$-intro)}

    UnaryInfC{$Gamma vdash lambda x . lambda y . x y Leftarrow A to B$}

    AxiomC{}

    RightLabel{$(*)$}

    UnaryInfC{$Gamma vdash T equiv A to B  mathsf{type}$}

    RightLabel{(switch)}

    BinaryInfC{$Gamma vdash lambda x . lambda y . x y Rightarrow T$}

end{prooftree}

Which gives me the following tree:

Is there a way I can get rid of the whitespace in the middle? Where (*) and (**) take place it would be nice to slide them under the tree. I don't think this is possible in bussproofs from what I have read but I could be wrong.

For example if there is a local horizontal spacing when I do a BinaryInfC that I could change that might let me squish them together.

horizontal-alignment bussproofs

share

asked 4 mins ago

Ali CaglayanAli Caglayan

238137

add a comment | 

I have the following code:

begin{prooftree}

    AxiomC{$Gamma $}

    AxiomC{}

    LeftLabel{($to$-elim)}

    BinaryInfC{$Gamma , x : A, y : C vdash x y Leftarrow D$}

    AxiomC{}

    LeftLabel{($equiv_{mathsf{type}}$-refl)}

    UnaryInfC{$Gamma , x : A, y : C vdash D equiv D$}

    LeftLabel{(switch)}

    BinaryInfC{$Gamma , x : A , y : C vdash xy Rightarrow D$}

    LeftLabel{($to$-intro)}

    UnaryInfC{$Gamma , x : A vdash lamba y . x y Leftarrow C to D$}

    AxiomC{}

    LeftLabel{$(**)$}

    UnaryInfC{$Gamma , x : A vdash B equiv C to D  mathsf{type}$}

    LeftLabel{(switch)}

    BinaryInfC{$ Gamma , x : A vdash lambda y . xy Rightarrow B$}

    LeftLabel{($to$-intro)}

    UnaryInfC{$Gamma vdash lambda x . lambda y . x y Leftarrow A to B$}

    AxiomC{}

    RightLabel{$(*)$}

    UnaryInfC{$Gamma vdash T equiv A to B  mathsf{type}$}

    RightLabel{(switch)}

    BinaryInfC{$Gamma vdash lambda x . lambda y . x y Rightarrow T$}

end{prooftree}

Which gives me the following tree:

Is there a way I can get rid of the whitespace in the middle? Where (*) and (**) take place it would be nice to slide them under the tree. I don't think this is possible in bussproofs from what I have read but I could be wrong.

For example if there is a local horizontal spacing when I do a BinaryInfC that I could change that might let me squish them together.

horizontal-alignment bussproofs

share

asked 4 mins ago

Ali CaglayanAli Caglayan

238137

begin{prooftree}

    AxiomC{$Gamma $}

    AxiomC{}

    LeftLabel{($to$-elim)}

    BinaryInfC{$Gamma , x : A, y : C vdash x y Leftarrow D$}

    AxiomC{}

    LeftLabel{($equiv_{mathsf{type}}$-refl)}

    UnaryInfC{$Gamma , x : A, y : C vdash D equiv D$}

    LeftLabel{(switch)}

    BinaryInfC{$Gamma , x : A , y : C vdash xy Rightarrow D$}

    LeftLabel{($to$-intro)}

    UnaryInfC{$Gamma , x : A vdash lamba y . x y Leftarrow C to D$}

    AxiomC{}

    LeftLabel{$(**)$}

    UnaryInfC{$Gamma , x : A vdash B equiv C to D  mathsf{type}$}

    LeftLabel{(switch)}

    BinaryInfC{$ Gamma , x : A vdash lambda y . xy Rightarrow B$}

    LeftLabel{($to$-intro)}

    UnaryInfC{$Gamma vdash lambda x . lambda y . x y Leftarrow A to B$}

    AxiomC{}

    RightLabel{$(*)$}

    UnaryInfC{$Gamma vdash T equiv A to B  mathsf{type}$}

    RightLabel{(switch)}

    BinaryInfC{$Gamma vdash lambda x . lambda y . x y Rightarrow T$}

end{prooftree}

share

asked 4 mins ago

Ali CaglayanAli Caglayan

238137

share

asked 4 mins ago

Ali CaglayanAli Caglayan

238137

asked 4 mins ago

Ali CaglayanAli Caglayan

238137

asked 4 mins ago

Ali CaglayanAli Caglayan

238137