Let x be given.
Set x0 to be the term
x 0.
Set x1 to be the term
x 1.
We prove the intermediate
claim Heta:
x = (x0,x1).
rewrite the current goal using Heta (from left to right) at position 2.
We prove the intermediate
claim Hx0def:
x0 = x 0.
We prove the intermediate
claim Hx1def:
x1 = x 1.
rewrite the current goal using Hx0def (from left to right).
Let i be given.
Apply (xm (k ∈ i)) to the current goal.
We prove the intermediate
claim Hx0prop:
∀j : set, j ∈ ω → k ∈ j → apply_fun x0 j = 0.
rewrite the current goal using HdefT (from right to left).
An exact proof term for the current goal is Hx0tilde.
rewrite the current goal using (Hx0prop i Hi Hki) (from left to right).
Use reflexivity.
We prove the intermediate
claim HnEq:
¬ (i = ordsucc k).
Apply Hnki to the current goal.
rewrite the current goal using Heq (from left to right).
An
exact proof term for the current goal is
(ordsuccI2 k).
We prove the intermediate
claim HnSuccIn:
¬ (ordsucc k ∈ i).
Apply Hnki to the current goal.
We prove the intermediate
claim Hordi:
ordinal i.
We prove the intermediate
claim HTi:
TransSet i.
We prove the intermediate
claim Hsub:
ordsucc k ⊆ i.
An
exact proof term for the current goal is
(HTi (ordsucc k) Hsi).
An
exact proof term for the current goal is
(Hsub k (ordsuccI2 k)).
rewrite the current goal using Hx0def (from left to right).
Use reflexivity.
We prove the intermediate
claim HsuccO:
ordsucc k ∈ ω.
An
exact proof term for the current goal is
(omega_ordsucc k HkO).
rewrite the current goal using Hx1def (from left to right).
Use reflexivity.
rewrite the current goal using HrestEq (from left to right).
rewrite the current goal using HcoordEq (from left to right).
Use reflexivity.