Let X, d, x and A be given.
We prove the intermediate
claim HexS:
∃t0 : set, t0 ∈ S.
We prove the intermediate
claim HexA:
∃a0 : set, a0 ∈ A.
Set a0 to be the term
Eps_i (λa : set ⇒ a ∈ A).
We prove the intermediate
claim Ha0:
a0 ∈ A.
An
exact proof term for the current goal is
(Eps_i_ex (λa : set ⇒ a ∈ A) HexA).
rewrite the current goal using HSdef (from left to right).
We prove the intermediate
claim HS_R:
∀t : set, t ∈ S → t ∈ R.
We prove the intermediate
claim HubS:
∃u : set, u ∈ R ∧ ∀t : set, t ∈ S → t ∈ R → Rle t u.
We use
0 to
witness the existential quantifier.
We will
prove 0 ∈ R ∧ ∀t : set, t ∈ S → t ∈ R → Rle t 0.
Apply andI to the current goal.
An
exact proof term for the current goal is
real_0.
We prove the intermediate
claim Hexlub:
∃l : set, R_lub S l.
An
exact proof term for the current goal is
(R_lub_exists S HexS HS_R HubS).
An
exact proof term for the current goal is
(Eps_i_ex (λl : set ⇒ R_lub S l) Hexlub).
∎