query: Disequality in Type Theory
positive_passages.docid: 154459
positive_passages.text: Constructing a HoTT proof term of 1≠0
negative_passages.docid: 80183
negative_passages.text: Deduction of "Disjunction elimination"
negative_passages.docid: 90901
negative_passages.text: Maintaining Units of measure across type converstions
negative_passages.docid: 42723
negative_passages.text: Lattices are congruence-distributive
negative_passages.docid: 28154
negative_passages.text: Riehl's Category Theory in Context - Exercise 2.1.iv.
negative_passages.docid: 3217
negative_passages.text: Construction of uncountably many non-isomorphic linear (total) orderings of natural numbers
negative_passages.docid: 150451
negative_passages.text: Logic soundness and completeness
negative_passages.docid: 77026
negative_passages.text: Proof with inequalities
negative_passages.docid: 126633
negative_passages.text: Is a contradiction enough to prove a set equality to $\varnothing$?
negative_passages.docid: 25997
negative_passages.text: Conditions Equivalent to Injectivity
negative_passages.docid: 127596
negative_passages.text: Composition of equivalence relations
negative_passages.docid: 57435
negative_passages.text: Type inference with GADTs - a0 is untouchable
negative_passages.docid: 141318
negative_passages.text: $\subset$ vs $\subseteq$ when *not* referring to strict inclusion
negative_passages.docid: 3465
negative_passages.text: Equivalence relations and power sets.
negative_passages.docid: 62936
negative_passages.text: Proving equivalencies of two versions of the Axiom of Choice
negative_passages.docid: 29744
negative_passages.text: Compactness and axiomatisability
negative_passages.docid: 142782
negative_passages.text: Operator< and strict weak ordering