Let X, Tx and Fam be given.
Let x be given.
We prove the intermediate
claim HexS:
∃S : set, finite S ∧ S ⊆ ClFam ∧ ∀B : set, B ∈ ClFam → x ∈ B → B ∈ S.
Apply HexS to the current goal.
Let S be given.
We use S to witness the existential quantifier.
Apply andI to the current goal.
We prove the intermediate
claim HS1:
finite S ∧ S ⊆ ClFam.
An
exact proof term for the current goal is
(andEL (finite S ∧ S ⊆ ClFam) (∀B : set, B ∈ ClFam → x ∈ B → B ∈ S) HS).
An exact proof term for the current goal is HS1.
We prove the intermediate
claim HSprop:
∀B : set, B ∈ ClFam → x ∈ B → B ∈ S.
An
exact proof term for the current goal is
(andER (finite S ∧ S ⊆ ClFam) (∀B : set, B ∈ ClFam → x ∈ B → B ∈ S) HS).
Let A be given.
We prove the intermediate
claim HclIn:
closure_of X Tx A ∈ ClFam.
An
exact proof term for the current goal is
(ReplI Fam (λA0 : set ⇒ closure_of X Tx A0) A HA).
An
exact proof term for the current goal is
(HSprop (closure_of X Tx A) HclIn Hxcl).
∎