```
module Types.variations where
open import Types.equality
```

When two objects `a, b ∈ β`

are equal, their equality itself is represented by a type `a =ᵦ b`

. These types are identity types or equality types. These equality types form a family with one type per object in `β`

, written as:

`Idᵦ : β → β → Set`

such that `Idᵦ(a, b)`

where `a, b, ∈ β`

is the propositional equality type for `a = b`

.

The identity type for any two objects \(x, y ∈ A\) if of the form \(x =_A y\) represents the type of the proof that x is equal to y. The proof is equivalent to demonstrating that the type is inhabited, i.e. an object of that type can be created. The elimination rule on identity types, called the **J rule** looks like:

```
: {A : Set} →
J (P : (x y : A) → x ≡ y → Set)
→ ((x : A) → P x x refl)
→ (x y : A)
→ (x≡y : x ≡ y)
→ P x y x≡y
.x refl = p x J P p x
```

where `P`

is a predicate that it holds for any two objects `x, y`

of type A which are propositionally equal. `p`

is the a form that constructs `P`

for the case when x and y are both the same object `x`

and reflexivity `refl`

of the propositional equality `≡`

. The rule states that any identity `x≡y`

can be proven using the reflexivity of the propositionlly equal objects `x`

and `y`

. Thus the J rule can be used with reflexivity `refl`

or `x≡x`

and `y≡y`

to prove the equality of all identity types, including `x≡y`

.

Axiom K is an identity eliminator which when defined can be used as an elimination rule to prove all identities as equal. It is also called **principle of uniqueness of identity proofs**.

```
K : {A : Set} {x : A}
P : x ≡ x → Set)
(→ P refl
→ (x≡x : x ≡ x)
→ P x≡x
K P p refl = p
```

Note that without the `--with-K`

command-line or the `{-# OPTIONS --with-K #-}`

inline option, agda will not compile axiom K. This is because we cannot assume every `x ≡ x`

to be equal to `refl`

, or that all identity propositions can be proven by `refl`

.

`x≡x : x ≡ x =?= refl`

The error message explains this rather clearly:

```
I'm not sure if there should be a case for the constructor refl,
because I get stuck when trying to solve the following unification
problems (inferred index ≟ expected index):
x ≟ x
Possible reason why unification failed:
Cannot eliminate reflexive equation x = x of type A because K has been disabled.
```

An alternative to axiom K and assuming the uniqueness of all identities is considering identities as paths, which are objects of Homotopy theory from Algebraic Geometry. We could then used homotopy theory to model all types as ∞-groupoids and work with some non-trivial interesting structures rather than the dead-end that is axiom K. We shall develop this theory later in this work.