Set G0 to be the term
G ∖ {B}.
Set H to be the term
G0 ∪ F.
We prove the intermediate
claim HG0subG:
G0 ⊆ G.
We prove the intermediate
claim HG0fin:
finite G0.
An
exact proof term for the current goal is
(Subq_finite G HGfin G0 HG0subG).
We prove the intermediate
claim Hfin:
finite H.
An
exact proof term for the current goal is
(binunion_finite G0 HG0fin F HFfin).
We prove the intermediate
claim HG0subD:
G0 ⊆ D.
Let U be given.
We prove the intermediate
claim HUG:
U ∈ G.
An
exact proof term for the current goal is
(setminusE1 G {B} U HU0).
We prove the intermediate
claim HUE:
U ∈ E.
An exact proof term for the current goal is (HGsub U HUG).
An exact proof term for the current goal is HUD.
Apply FalseE to the current goal.
An
exact proof term for the current goal is
((setminusE2 G {B} U HU0) HUB).
An exact proof term for the current goal is HUE.
We prove the intermediate
claim HsubD:
H ⊆ D.
Let U be given.
An exact proof term for the current goal is (HG0subD U HUG0).
An exact proof term for the current goal is (HFsub U HUF).
An exact proof term for the current goal is HU.
An exact proof term for the current goal is (HDfip H Hfin HsubD).
Let x be given.
We prove the intermediate
claim HxX:
x ∈ X.
An
exact proof term for the current goal is
(SepE1 X (λz : set ⇒ ∀T : set, T ∈ H → z ∈ T) x HxH).
We prove the intermediate
claim HallH:
∀T : set, T ∈ H → x ∈ T.
An
exact proof term for the current goal is
(SepE2 X (λz : set ⇒ ∀T : set, T ∈ H → z ∈ T) x HxH).
We prove the intermediate
claim HallG:
∀T : set, T ∈ G → x ∈ T.
Let T be given.
Apply (xm (T = B)) to the current goal.
rewrite the current goal using HTB (from left to right).
We prove the intermediate
claim HallF:
∀U : set, U ∈ F → x ∈ U.
Let U be given.
An
exact proof term for the current goal is
(HallH U (binunionI2 G0 F U HUF)).
We prove the intermediate
claim HTnSing:
T ∉ {B}.
We prove the intermediate
claim HTB:
T = B.
An
exact proof term for the current goal is
(SingE B T HTSing).
An exact proof term for the current goal is (HTnB HTB).
We prove the intermediate
claim HTG0:
T ∈ G0.
An
exact proof term for the current goal is
(setminusI G {B} T HTG HTnSing).
An
exact proof term for the current goal is
(HallH T (binunionI1 G0 F T HTG0)).