Let y be given.
Let F be given.
We prove the intermediate
claim HexC:
∃C : set, closed_in X Tx C ∧ F = C ∩ Y.
Apply HexC to the current goal.
Let C be given.
Assume HCpair.
We prove the intermediate
claim HCcl:
closed_in X Tx C.
An
exact proof term for the current goal is
(andEL (closed_in X Tx C) (F = C ∩ Y) HCpair).
We prove the intermediate
claim HFeq:
F = C ∩ Y.
An
exact proof term for the current goal is
(andER (closed_in X Tx C) (F = C ∩ Y) HCpair).
We prove the intermediate
claim HyX:
y ∈ X.
An exact proof term for the current goal is (HYsub y HyY).
We prove the intermediate
claim HyNotC:
y ∉ C.
We prove the intermediate
claim HyCY:
y ∈ C ∩ Y.
An
exact proof term for the current goal is
(binintersectI C Y y HyC HyY).
We prove the intermediate
claim HyF:
y ∈ F.
rewrite the current goal using HFeq (from left to right).
An exact proof term for the current goal is HyCY.
An exact proof term for the current goal is (HynotF HyF).
Apply Hexf to the current goal.
Let f be given.
Assume Hfprop.
We use f to witness the existential quantifier.
We prove the intermediate
claim Hfy0:
apply_fun f y = 0.
We prove the intermediate
claim HfC:
∀z : set, z ∈ C → apply_fun f z = 1.
Apply andI to the current goal.
Apply andI to the current goal.
An exact proof term for the current goal is Hfy0.
Let z be given.
We prove the intermediate
claim HzCY:
z ∈ C ∩ Y.
rewrite the current goal using HFeq (from right to left).
An exact proof term for the current goal is HzF.
We prove the intermediate
claim HzC:
z ∈ C.
An
exact proof term for the current goal is
(binintersectE1 C Y z HzCY).
An exact proof term for the current goal is (HfC z HzC).