Let f and g be given.
Assume Hf: f ∈ real_sequences.
Assume Hg: g ∈ real_sequences.
Assume Hagree: ∀n : set, n ∈ ω → apply_fun f n = apply_fun g n.
We prove the intermediate claim HfPow: f ∈ 𝒫 (setprod ω R).
An exact proof term for the current goal is (SepE1 (𝒫 (setprod ω R)) (λf0 : set ⇒ total_function_on f0 ω R ∧ functional_graph f0) f Hf).
We prove the intermediate claim HgPow: g ∈ 𝒫 (setprod ω R).
An exact proof term for the current goal is (SepE1 (𝒫 (setprod ω R)) (λf0 : set ⇒ total_function_on f0 ω R ∧ functional_graph f0) g Hg).
We prove the intermediate claim HfSub: f ⊆ setprod ω R.
An exact proof term for the current goal is (PowerE (setprod ω R) f HfPow).
We prove the intermediate claim HgSub: g ⊆ setprod ω R.
An exact proof term for the current goal is (PowerE (setprod ω R) g HgPow).
We prove the intermediate claim Hfpack: total_function_on f ω R ∧ functional_graph f.
An exact proof term for the current goal is (SepE2 (𝒫 (setprod ω R)) (λf0 : set ⇒ total_function_on f0 ω R ∧ functional_graph f0) f Hf).
We prove the intermediate claim Hgpack: total_function_on g ω R ∧ functional_graph g.
An exact proof term for the current goal is (SepE2 (𝒫 (setprod ω R)) (λg0 : set ⇒ total_function_on g0 ω R ∧ functional_graph g0) g Hg).
We prove the intermediate claim Hftot: total_function_on f ω R.
An exact proof term for the current goal is (andEL (total_function_on f ω R) (functional_graph f) Hfpack).
We prove the intermediate claim Hgtot: total_function_on g ω R.
An exact proof term for the current goal is (andEL (total_function_on g ω R) (functional_graph g) Hgpack).
We prove the intermediate claim Hffun: functional_graph f.
An exact proof term for the current goal is (andER (total_function_on f ω R) (functional_graph f) Hfpack).
We prove the intermediate claim Hgfun: functional_graph g.
An exact proof term for the current goal is (andER (total_function_on g ω R) (functional_graph g) Hgpack).
We prove the intermediate claim Hgtot2: ∀n : set, n ∈ ω → ∃y : set, y ∈ R ∧ (n,y) ∈ g.
An exact proof term for the current goal is (andER (function_on g ω R) (∀x : set, x ∈ ω → ∃y : set, y ∈ R ∧ (x,y) ∈ g) Hgtot).
We prove the intermediate claim Hftot2: ∀n : set, n ∈ ω → ∃y : set, y ∈ R ∧ (n,y) ∈ f.
An exact proof term for the current goal is (andER (function_on f ω R) (∀x : set, x ∈ ω → ∃y : set, y ∈ R ∧ (x,y) ∈ f) Hftot).
Apply set_ext to the current goal.
Let p be given.
Assume Hp: p ∈ f.
We will prove p ∈ g.
We prove the intermediate claim HpXY: p ∈ setprod ω R.
An exact proof term for the current goal is (HfSub p Hp).
We prove the intermediate claim Heta: p = (p 0,p 1).
An exact proof term for the current goal is (setprod_eta ω R p HpXY).
We prove the intermediate claim Hp0: p 0 ∈ ω.
An exact proof term for the current goal is (ap0_Sigma ω (λ_ : set ⇒ R) p HpXY).
We prove the intermediate claim Hp1: p 1 ∈ R.
An exact proof term for the current goal is (ap1_Sigma ω (λ_ : set ⇒ R) p HpXY).
We prove the intermediate claim Hpair: (p 0,p 1) ∈ f.
rewrite the current goal using Heta (from right to left).
An exact proof term for the current goal is Hp.
We prove the intermediate claim Happf: apply_fun f (p 0) = (p 1).
An exact proof term for the current goal is (functional_graph_apply_fun_eq f (p 0) (p 1) Hffun Hpair).
We prove the intermediate claim Hfg: apply_fun f (p 0) = apply_fun g (p 0).
An exact proof term for the current goal is (Hagree (p 0) Hp0).
We prove the intermediate claim Hgf: apply_fun g (p 0) = apply_fun f (p 0).
Use symmetry.
An exact proof term for the current goal is Hfg.
We prove the intermediate claim Happg: apply_fun g (p 0) = (p 1).
rewrite the current goal using Hgf (from left to right).
An exact proof term for the current goal is Happf.
We prove the intermediate claim Hexg: ∃y : set, (p 0,y) ∈ g.
Apply (Hgtot2 (p 0) Hp0) to the current goal.
Let y be given.
Assume Hy: y ∈ R ∧ (p 0,y) ∈ g.
We use y to witness the existential quantifier.
An exact proof term for the current goal is (andER (y ∈ R) ((p 0,y) ∈ g) Hy).
We prove the intermediate claim Hgpair: (p 0,apply_fun g (p 0)) ∈ g.
An exact proof term for the current goal is (apply_fun_in_graph_of_ex g (p 0) Hexg).
We prove the intermediate claim Hpeq: (p 0,apply_fun g (p 0)) = (p 0,p 1).
rewrite the current goal using Happg (from left to right).
Use reflexivity.
rewrite the current goal using Heta (from left to right).
rewrite the current goal using Hpeq (from right to left).
An exact proof term for the current goal is Hgpair.
Let p be given.
Assume Hp: p ∈ g.
We will prove p ∈ f.
We prove the intermediate claim HpXY: p ∈ setprod ω R.
An exact proof term for the current goal is (HgSub p Hp).
We prove the intermediate claim Heta: p = (p 0,p 1).
An exact proof term for the current goal is (setprod_eta ω R p HpXY).
We prove the intermediate claim Hp0: p 0 ∈ ω.
An exact proof term for the current goal is (ap0_Sigma ω (λ_ : set ⇒ R) p HpXY).
We prove the intermediate claim Hp1: p 1 ∈ R.
An exact proof term for the current goal is (ap1_Sigma ω (λ_ : set ⇒ R) p HpXY).
We prove the intermediate claim Hpair: (p 0,p 1) ∈ g.
rewrite the current goal using Heta (from right to left).
An exact proof term for the current goal is Hp.
We prove the intermediate claim Happg: apply_fun g (p 0) = (p 1).
An exact proof term for the current goal is (functional_graph_apply_fun_eq g (p 0) (p 1) Hgfun Hpair).
We prove the intermediate claim Hfg: apply_fun f (p 0) = apply_fun g (p 0).
An exact proof term for the current goal is (Hagree (p 0) Hp0).
We prove the intermediate claim Happf: apply_fun f (p 0) = (p 1).
rewrite the current goal using Hfg (from left to right).
An exact proof term for the current goal is Happg.
We prove the intermediate claim Hexf: ∃y : set, (p 0,y) ∈ f.
Apply (Hftot2 (p 0) Hp0) to the current goal.
Let y be given.
Assume Hy: y ∈ R ∧ (p 0,y) ∈ f.
We use y to witness the existential quantifier.
An exact proof term for the current goal is (andER (y ∈ R) ((p 0,y) ∈ f) Hy).
We prove the intermediate claim Hfpair: (p 0,apply_fun f (p 0)) ∈ f.
An exact proof term for the current goal is (apply_fun_in_graph_of_ex f (p 0) Hexf).
We prove the intermediate claim Hpeq: (p 0,apply_fun f (p 0)) = (p 0,p 1).
rewrite the current goal using Happf (from left to right).
Use reflexivity.
rewrite the current goal using Heta (from left to right).
rewrite the current goal using Hpeq (from right to left).
An exact proof term for the current goal is Hfpair.
∎