Let x0 of type ι → (ι → ι) → ι be given.
Assume H0:
∀ x1 . ∀ x2 x3 : ι → ι . (∀ x4 . prim1 x4 x1 ⟶ x2 x4 = x3 x4) ⟶ x0 x1 x2 = x0 x1 x3.
Apply In_ind with
λ x1 . ∀ x2 x3 . In_rec_i_G x0 x1 x2 ⟶ In_rec_i_G x0 x1 x3 ⟶ x2 = x3.
Let x1 of type ι be given.
Let x2 of type ι be given.
Let x3 of type ι be given.
Claim L4:
∃ x4 : ι → ι . and (∀ x5 . prim1 x5 x1 ⟶ In_rec_i_G x0 x5 (x4 x5)) (x2 = x0 x1 x4)Apply In_rec_i_G_inv with
x0,
x1,
x2.
The subproof is completed by applying H2.
Claim L5:
∃ x4 : ι → ι . and (∀ x5 . prim1 x5 x1 ⟶ In_rec_i_G x0 x5 (x4 x5)) (x3 = x0 x1 x4)Apply In_rec_i_G_inv with
x0,
x1,
x3.
The subproof is completed by applying H3.
Apply exandE_ii with
λ x4 : ι → ι . ∀ x5 . prim1 x5 x1 ⟶ In_rec_i_G x0 x5 (x4 x5),
λ x4 : ι → ι . x2 = x0 x1 x4,
x2 = x3 leaving 2 subgoals.
The subproof is completed by applying L4.
Let x4 of type ι → ι be given.
Assume H7: x2 = x0 x1 x4.
Apply exandE_ii with
λ x5 : ι → ι . ∀ x6 . prim1 x6 x1 ⟶ In_rec_i_G x0 x6 (x5 x6),
λ x5 : ι → ι . x3 = x0 x1 x5,
x2 = x3 leaving 2 subgoals.
The subproof is completed by applying L5.
Let x5 of type ι → ι be given.
Assume H9: x3 = x0 x1 x5.
Apply H7 with
λ x6 x7 . x7 = x3.
Apply H9 with
λ x6 x7 . x0 x1 x4 = x7.
Apply H0 with
x1,
x4,
x5.
Let x6 of type ι be given.
Apply H1 with
x6,
x4 x6,
x5 x6 leaving 3 subgoals.
The subproof is completed by applying H10.
Apply H6 with
x6.
The subproof is completed by applying H10.
Apply H8 with
x6.
The subproof is completed by applying H10.