Let w be given.
Let z be given.
We prove the intermediate
claim L1:
∀w, SNo w → ∀g h : set → set → set, (∀x ∈ SNoS_ (SNoLev w), g x = h x) → H w g = H w h.
Let w be given.
Let g and h be given.
We will prove H w g = H w h.
We will
prove (λz : set ⇒ if SNo z then SNo_rec_i (G w g) z else Empty) = (λz : set ⇒ if SNo z then SNo_rec_i (G w h) z else Empty).
Apply func_ext set set to the current goal.
Let z be given.
Apply xm (SNo z) to the current goal.
rewrite the current goal using
If_i_1 (SNo z) (SNo_rec_i (G w g) z) Empty Hz (from left to right).
rewrite the current goal using
If_i_1 (SNo z) (SNo_rec_i (G w h) z) Empty Hz (from left to right).
We prove the intermediate
claim L1a:
∀alpha, ordinal alpha → ∀z ∈ SNoS_ alpha, SNo_rec_i (G w g) z = SNo_rec_i (G w h) z.
Apply ordinal_ind to the current goal.
Let alpha be given.
Assume Ha: ordinal alpha.
Let z be given.
Apply SNoS_E2 alpha Ha z Hz to the current goal.
rewrite the current goal using
SNo_rec2_eq_1 w Hw g z Hz3 (from left to right).
rewrite the current goal using
SNo_rec2_eq_1 w Hw h z Hz3 (from left to right).
Let y be given.
An
exact proof term for the current goal is
IH (SNoLev z) Hz1 y Hy.
rewrite the current goal using
If_i_0 (SNo z) (SNo_rec_i (G w h) z) Empty Hz (from left to right).
An
exact proof term for the current goal is
If_i_0 (SNo z) (SNo_rec_i (G w g) z) Empty Hz.
rewrite the current goal using
If_i_1 (SNo z) (SNo_rec_i (G w (SNo_rec_ii H)) z) Empty Hz (from left to right).
Let x be given.
Let y be given.
We prove the intermediate claim Lxw: x ≠ w.
An
exact proof term for the current goal is
SNoS_In_neq w Hw x Hx.
Let y be given.
We prove the intermediate
claim Ly:
SNo y.
An exact proof term for the current goal is Hy3.
rewrite the current goal using
SNo_rec_ii_eq H L1 w Hw (from left to right).
An exact proof term for the current goal is (λq H ⇒ H).
rewrite the current goal using
SNo_rec_ii_eq H L1 w Hw (from left to right).
An exact proof term for the current goal is L2.
∎