Let P of type prop be given.
Set p1 to be the term
λx : set ⇒ x = Empty ∨ P.
Set p2 to be the term
λx : set ⇒ x ≠ Empty ∨ P.
We prove the intermediate
claim L1:
p1 Empty.
Apply orIL to the current goal.
An exact proof term for the current goal is (λq H ⇒ H).
An
exact proof term for the current goal is
(Eps_i_ax p1 Empty L1).
We prove the intermediate
claim L3:
p2 (𝒫 Empty).
Apply orIL to the current goal.
rewrite the current goal using H1 (from right to left) at position 2.
An
exact proof term for the current goal is
(Eps_i_ax p2 (𝒫 Empty) L3).
Apply L2 to the current goal.
Apply L4 to the current goal.
Apply orIR to the current goal.
Assume H3: P.
We prove the intermediate
claim L5:
p1 = p2.
Let x be given.
Apply iffI to the current goal.
Assume H4.
Apply orIR to the current goal.
We will prove P.
An exact proof term for the current goal is H3.
Assume H4.
Apply orIR to the current goal.
We will prove P.
An exact proof term for the current goal is H3.
Apply H2 to the current goal.
rewrite the current goal using L5 (from right to left).
An exact proof term for the current goal is H1.
Assume H2: P.
Apply orIL to the current goal.
We will prove P.
An exact proof term for the current goal is H2.
Assume H1: P.
Apply orIL to the current goal.
We will prove P.
An exact proof term for the current goal is H1.
∎