Let X and x be given.
Assume Hxx: order_rel X x x.
Apply (Hxx False) to the current goal.
Assume H6.
Apply (H6 False) to the current goal.
Assume H5.
Apply (H5 False) to the current goal.
Assume H4.
Apply (H4 False) to the current goal.
Assume H3.
Apply (H3 False) to the current goal.
Assume H2.
Apply (H2 False) to the current goal.
Assume HXR.
We prove the intermediate claim Hlt: Rlt x x.
An exact proof term for the current goal is (andER (X = R) (Rlt x x) HXR).
We prove the intermediate claim HxR: x R.
An exact proof term for the current goal is (RltE_left x x Hlt).
An exact proof term for the current goal is ((not_Rlt_refl x HxR) Hlt).
Assume HXQ.
We prove the intermediate claim Hlt: Rlt x x.
An exact proof term for the current goal is (andER (X = rational_numbers) (Rlt x x) HXQ).
We prove the intermediate claim HxR: x R.
An exact proof term for the current goal is (RltE_left x x Hlt).
An exact proof term for the current goal is ((not_Rlt_refl x HxR) Hlt).
Assume HXo.
We prove the intermediate claim Hmem: x x.
An exact proof term for the current goal is (andER (X = ω) (x x) HXo).
An exact proof term for the current goal is (In_irref x Hmem).
Assume HXo0.
We prove the intermediate claim Hmem: x x.
An exact proof term for the current goal is (andER (X = ω {0}) (x x) HXo0).
An exact proof term for the current goal is (In_irref x Hmem).
Assume HX2o.
We prove the intermediate claim Hex: ∃i m j n : set, (i 2 m ω j 2 n ω x = (i,m) x = (j,n) (i j (i = j m n))).
An exact proof term for the current goal is (andER (X = setprod 2 ω) (∃i m j n : set, (i 2 m ω j 2 n ω x = (i,m) x = (j,n) (i j (i = j m n)))) HX2o).
Apply Hex to the current goal.
Let i be given.
Assume Hmjn.
Apply Hmjn to the current goal.
Let m be given.
Assume Hjnn.
Apply Hjnn to the current goal.
Let j be given.
Assume Hnn.
Apply Hnn to the current goal.
Let n be given.
Assume Hpack.
We prove the intermediate claim Hcoords5: (i 2 m ω j 2 n ω x = (i,m) x = (j,n)).
An exact proof term for the current goal is (andEL (i 2 m ω j 2 n ω x = (i,m) x = (j,n)) (i j (i = j m n)) Hpack).
We prove the intermediate claim Hcmp: i j (i = j m n).
An exact proof term for the current goal is (andER (i 2 m ω j 2 n ω x = (i,m) x = (j,n)) (i j (i = j m n)) Hpack).
We prove the intermediate claim Hcoords4: (i 2 m ω j 2 n ω x = (i,m)).
An exact proof term for the current goal is (andEL (i 2 m ω j 2 n ω x = (i,m)) (x = (j,n)) Hcoords5).
We prove the intermediate claim Hxjn: x = (j,n).
An exact proof term for the current goal is (andER (i 2 m ω j 2 n ω x = (i,m)) (x = (j,n)) Hcoords5).
We prove the intermediate claim Hxim: x = (i,m).
An exact proof term for the current goal is (andER (i 2 m ω j 2 n ω) (x = (i,m)) Hcoords4).
We prove the intermediate claim HeqPair: (i,m) = (j,n).
rewrite the current goal using Hxim (from right to left) at position 1.
An exact proof term for the current goal is Hxjn.
We prove the intermediate claim Hij: i = j.
rewrite the current goal using (tuple_2_0_eq i m) (from right to left).
rewrite the current goal using (tuple_2_0_eq j n) (from right to left).
rewrite the current goal using HeqPair (from right to left).
Use reflexivity.
We prove the intermediate claim Hmn: m = n.
rewrite the current goal using (tuple_2_1_eq i m) (from right to left).
rewrite the current goal using (tuple_2_1_eq j n) (from right to left).
rewrite the current goal using HeqPair (from right to left).
Use reflexivity.
Apply (Hcmp False) to the current goal.
Assume Hilj: i j.
We prove the intermediate claim Hii: i i.
We will prove i i.
rewrite the current goal using Hij (from left to right) at position 2.
An exact proof term for the current goal is Hilj.
An exact proof term for the current goal is (In_irref i Hii).
Assume Hind: i = j m n.
We prove the intermediate claim Hmnin: m n.
An exact proof term for the current goal is (andER (i = j) (m n) Hind).
We prove the intermediate claim Hmm: m m.
We will prove m m.
rewrite the current goal using Hmn (from left to right) at position 2.
An exact proof term for the current goal is Hmnin.
An exact proof term for the current goal is (In_irref m Hmm).
Assume HXRR.
We prove the intermediate claim Hex: ∃a1 a2 b1 b2 : set, x = (a1,a2) x = (b1,b2) (Rlt a1 b1 (a1 = b1 Rlt a2 b2)).
An exact proof term for the current goal is (andER (X = setprod R R) (∃a1 a2 b1 b2 : set, x = (a1,a2) x = (b1,b2) (Rlt a1 b1 (a1 = b1 Rlt a2 b2))) HXRR).
Apply Hex to the current goal.
Let a1 be given.
Assume Ha2b1b2.
Apply Ha2b1b2 to the current goal.
Let a2 be given.
Assume Hb1b2.
Apply Hb1b2 to the current goal.
Let b1 be given.
Assume Hb2.
Apply Hb2 to the current goal.
Let b2 be given.
Assume Hpack.
We prove the intermediate claim Hxyxz: x = (a1,a2) x = (b1,b2).
An exact proof term for the current goal is (andEL (x = (a1,a2) x = (b1,b2)) (Rlt a1 b1 (a1 = b1 Rlt a2 b2)) Hpack).
We prove the intermediate claim Hcmp: Rlt a1 b1 (a1 = b1 Rlt a2 b2).
An exact proof term for the current goal is (andER (x = (a1,a2) x = (b1,b2)) (Rlt a1 b1 (a1 = b1 Rlt a2 b2)) Hpack).
We prove the intermediate claim Hxy: x = (a1,a2).
An exact proof term for the current goal is (andEL (x = (a1,a2)) (x = (b1,b2)) Hxyxz).
We prove the intermediate claim Hxz: x = (b1,b2).
An exact proof term for the current goal is (andER (x = (a1,a2)) (x = (b1,b2)) Hxyxz).
We prove the intermediate claim HeqPair: (a1,a2) = (b1,b2).
We will prove (a1,a2) = (b1,b2).
rewrite the current goal using Hxy (from right to left) at position 1.
An exact proof term for the current goal is Hxz.
We prove the intermediate claim Hab1: a1 = b1.
rewrite the current goal using (tuple_2_0_eq a1 a2) (from right to left).
rewrite the current goal using (tuple_2_0_eq b1 b2) (from right to left).
rewrite the current goal using HeqPair (from right to left).
Use reflexivity.
We prove the intermediate claim Hab2: a2 = b2.
rewrite the current goal using (tuple_2_1_eq a1 a2) (from right to left).
rewrite the current goal using (tuple_2_1_eq b1 b2) (from right to left).
rewrite the current goal using HeqPair (from right to left).
Use reflexivity.
Apply (Hcmp False) to the current goal.
Assume Hlt: Rlt a1 b1.
We prove the intermediate claim Hltself: Rlt a1 a1.
We will prove Rlt a1 a1.
rewrite the current goal using Hab1 (from left to right) at position 2.
An exact proof term for the current goal is Hlt.
An exact proof term for the current goal is ((not_Rlt_refl a1 (RltE_left a1 a1 Hltself)) Hltself).
Assume Hlt2: a1 = b1 Rlt a2 b2.
We prove the intermediate claim Hlt: Rlt a2 b2.
An exact proof term for the current goal is (andER (a1 = b1) (Rlt a2 b2) Hlt2).
We prove the intermediate claim Hltself: Rlt a2 a2.
We will prove Rlt a2 a2.
rewrite the current goal using Hab2 (from left to right) at position 2.
An exact proof term for the current goal is Hlt.
An exact proof term for the current goal is ((not_Rlt_refl a2 (RltE_left a2 a2 Hltself)) Hltself).
Assume Hord.
We prove the intermediate claim Hmem: x x.
An exact proof term for the current goal is (andER ((((ordinal X X R) X rational_numbers) X setprod 2 ω) X setprod R R) (x x) Hord).
An exact proof term for the current goal is (In_irref x Hmem).