Let x0 of type ι be given.
Let x1 of type ι → ο be given.
Assume H0:
∀ x2 . x1 x2 ⟶ ∀ x3 . x3 ∈ x2 ⟶ nIn x0 x3.
Let x2 of type ι → ι be given.
Let x3 of type ι → ι → ι be given.
Assume H1: ∀ x4 . x1 x4 ⟶ x1 (x2 x4).
Assume H2: ∀ x4 . x1 x4 ⟶ x3 (x2 x4) x4 = 0.
Let x4 of type ι be given.
Apply CD_proj0R with
x0,
x1,
x4 leaving 2 subgoals.
The subproof is completed by applying H0.
The subproof is completed by applying H3.
Apply CD_proj1R with
x0,
x1,
x4 leaving 2 subgoals.
The subproof is completed by applying H0.
The subproof is completed by applying H3.
Apply H1 with
CD_proj0 x0 x1 x4.
The subproof is completed by applying L4.
Apply H1 with
CD_proj1 x0 x1 x4.
The subproof is completed by applying L5.
Apply CD_proj0_2 with
x0,
x1,
x2 (CD_proj0 x0 x1 x4),
x2 (CD_proj1 x0 x1 x4),
λ x5 x6 . pair_tag x0 (x3 x6 (CD_proj0 x0 x1 x4)) (x3 (CD_proj1 x0 x1 (pair_tag x0 (x2 (CD_proj0 x0 x1 x4)) (x2 (CD_proj1 x0 x1 x4)))) (CD_proj1 x0 x1 x4)) = 0 leaving 4 subgoals.
The subproof is completed by applying H0.
The subproof is completed by applying L6.
The subproof is completed by applying L7.
Apply CD_proj1_2 with
x0,
x1,
x2 (CD_proj0 x0 x1 x4),
x2 (CD_proj1 x0 x1 x4),
λ x5 x6 . pair_tag x0 (x3 (x2 (CD_proj0 x0 x1 x4)) (CD_proj0 x0 x1 x4)) (x3 x6 (CD_proj1 x0 x1 x4)) = 0 leaving 4 subgoals.
The subproof is completed by applying H0.
The subproof is completed by applying L6.
The subproof is completed by applying L7.
Apply H2 with
CD_proj0 x0 x1 x4,
λ x5 x6 . pair_tag x0 x6 (x3 (x2 (CD_proj1 x0 x1 x4)) (CD_proj1 x0 x1 x4)) = 0 leaving 2 subgoals.
The subproof is completed by applying L4.
Apply H2 with
CD_proj1 x0 x1 x4,
λ x5 x6 . pair_tag x0 0 x6 = 0 leaving 2 subgoals.
The subproof is completed by applying L5.
Apply pair_tag_0 with
x0,
x1,
0.
The subproof is completed by applying H0.