Let α and β be given.
Assume H1: α β.
Let x be given.
Assume H2: x α {γ '|γα}.
Apply binunionE α {γ '|γα} x H2 to the current goal.
Assume H3: x α.
We will prove x β {γ '|γβ}.
Apply binunionI1 to the current goal.
Apply H1 to the current goal.
An exact proof term for the current goal is H3.
Assume H3: x {γ '|γα}.
We will prove x β {γ '|γβ}.
Apply binunionI2 to the current goal.
We will prove x {γ '|γβ}.
Apply ReplE_impred α (λγ ⇒ γ ') x H3 to the current goal.
Let γ be given.
Assume H4: γ α.
Assume H5: x = γ '.
rewrite the current goal using H5 (from left to right).
We will prove γ ' {γ '|γβ}.
An exact proof term for the current goal is ReplI β (λγ ⇒ γ ') γ (H1 γ H4).