url stringclasses 147
values | commit stringclasses 147
values | file_path stringlengths 7 101 | full_name stringlengths 1 94 | start stringlengths 6 10 | end stringlengths 6 11 | tactic stringlengths 1 11.2k | state_before stringlengths 3 2.09M | state_after stringlengths 6 2.09M |
|---|---|---|---|---|---|---|---|---|
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply h <;> try trivial | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
h :
(∀ (x : A),
(∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_trans_clos R y z → joins R y_1 z) →
∀ (y z : A),... | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
h :
(∀ (x : A),
(∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_trans_clos R y z → joins R y_1 z) →
∀ (y ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | trivial | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
h :
(∀ (x : A),
(∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_trans_clos R y z → joins R y_1 z) →
∀ (y ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply norm_trans | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
h :
(∀ (x : A),
(∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_trans_clos R y z → joins R y_1 z) →
∀ (y ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | exists z | case a.refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y z✝ : A
wedge✝ : refl_trans_clos R x✝ y ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y... | case a.refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y z✝ : A
wedge✝ : refl_trans_clos R x✝ y ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | aesop | case a.refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y z✝ : A
wedge✝ : refl_trans_clos R x✝ y ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | case a.step y' red_x_y' red_y'_y =>
cases wedge.2
. exists y; aesop
. case step z' red_x_z' red_z'_z =>
have join1 := weak _ _ _ red_x_y' red_x_z'
cases' join1 with w h'
have join2 : y ~>*.*<~ w :=
by
apply ih
. apply trans_clos.base
apply red_x_y'
. aesop
have join3 : z ~>*.*<~ w :=
by
... | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | cases wedge.2 | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... | case refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . exists y; aesop | case refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1... | case step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . case step z' red_x_z' red_z'_z =>
have join1 := weak _ _ _ red_x_y' red_x_z'
cases' join1 with w h'
have join2 : y ~>*.*<~ w :=
by
apply ih
. apply trans_clos.base
apply red_x_y'
. aesop
have join3 : z ~>*.*<~ w :=
by
apply ih
. apply trans_clos.base
apply red_x_z'
. ae... | case step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | exists y | case refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1... | case refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | aesop | case refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | case step z' red_x_z' red_z'_z =>
have join1 := weak _ _ _ red_x_y' red_x_z'
cases' join1 with w h'
have join2 : y ~>*.*<~ w :=
by
apply ih
. apply trans_clos.base
apply red_x_y'
. aesop
have join3 : z ~>*.*<~ w :=
by
apply ih
. apply trans_clos.base
apply red_x_z'
. aesop
cases' join2 with w1 h1
ca... | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | have join1 := weak _ _ _ red_x_y' red_x_z' | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | cases' join1 with w h' | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | have join2 : y ~>*.*<~ w :=
by
apply ih
. apply trans_clos.base
apply red_x_y'
. aesop | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y ... | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | have join3 : z ~>*.*<~ w :=
by
apply ih
. apply trans_clos.base
apply red_x_z'
. aesop | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y ... | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | cases' join2 with w1 h1 | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y ... | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clo... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | cases' join3 with w2 h2 | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clo... | case intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_tra... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | have red_x_w : x ~>+ w :=
by
apply refl_trans_step_is_trans
. apply red_x_z'
. apply h'.2 | case intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_tra... | case intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_tra... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | have join4 : w1 ~>*.*<~ w2 :=
by
apply ih
. apply red_x_w
. aesop | case intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_tra... | case intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_tra... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | cases' join4 with omega h3 | case intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_tra... | case intro.intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), re... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | exists omega | case intro.intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), re... | case intro.intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), re... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | constructor | case intro.intro.intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), re... | case intro.intro.intro.intro.left
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply refl_trans_clos_transitive
. apply h1.1
. apply h3.1 | case intro.intro.intro.intro.left
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A... | case intro.intro.intro.intro.right
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply refl_trans_clos_transitive
. apply h2.1
. apply h3.2 | case intro.intro.intro.intro.right
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply ih | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply trans_clos.base
apply red_x_y' | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . aesop | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply trans_clos.base | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | case a.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply red_x_y' | case a.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | aesop | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply ih | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply trans_clos.base
apply red_x_z' | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . aesop | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply trans_clos.base | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | case a.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply red_x_z' | case a.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | aesop | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply refl_trans_step_is_trans | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply red_x_z' | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply h'.2 | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply red_x_z' | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply h'.2 | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply ih | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ∧ refl_... | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply red_x_w | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . aesop | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply red_x_w | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | aesop | case a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A), refl_trans_clos R y y_1 ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply refl_trans_clos_transitive | case intro.intro.intro.intro.left
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : A... | case intro.intro.intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z :... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply h1.1 | case intro.intro.intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z :... | case intro.intro.intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z :... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply h3.1 | case intro.intro.intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z :... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply h1.1 | case intro.intro.intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z :... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply h3.1 | case intro.intro.intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z :... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply refl_trans_clos_transitive | case intro.intro.intro.intro.right
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z : ... | case intro.intro.intro.intro.right.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply h2.1 | case intro.intro.intro.intro.right.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z ... | case intro.intro.intro.intro.right.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | . apply h3.2 | case intro.intro.intro.intro.right.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply h2.1 | case intro.intro.intro.intro.right.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | newmans_lemma | [626, 1] | [685, 21] | apply h3.2 | case intro.intro.intro.intro.right.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
norm_R : normalizing R
weak : weakly_confluent R
x✝ : A
norm_trans : normalizing fun x x_1 => trans_clos R x x_1
y✝ z✝ : A
wedge✝ : refl_trans_clos R x✝ y✝ ∧ refl_trans_clos R x✝ z✝
x : A
ih : ∀ (y : A), trans_clos R x y → ∀ (y_1 z ... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | intros conf x y z red_x_y red_x_z norm_y norm_z | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
⊢ confluent R → ∀ (x y z : A), refl_trans_clos R x y → refl_trans_clos R x z → normal R y → normal R z → y = z | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
⊢ y = z |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | have wdg_y_z : wedge _ y z := Exists.intro x ⟨ red_x_y, red_x_z ⟩ | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
⊢ y = z | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
⊢ y = z |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | have h : y ~>*.*<~ z := conf _ _ wdg_y_z | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
⊢ y = z | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
h : joins R y z
⊢ y = z |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | cases' h with w h | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
h : joins R y z
⊢ y = z | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
h : refl_trans_clos R y w ∧ refl_trans_clos R z w
⊢ y = z |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | cases h | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
h : refl_trans_clos R y w ∧ refl_trans_clos R z w
⊢ y = z | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
left✝ : refl_trans_clos R y w
right✝ : refl_trans_clos R z w
⊢ y = z |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | have eq_y_w : y = w := by apply normal_red <;> trivial | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
left✝ : refl_trans_clos R y w
right✝ : refl_trans_clos R z w
⊢ y = z | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
left✝ : refl_trans_clos R y w
right✝ : refl_trans_clos R z w
eq_y_w : y = w
⊢ y = z |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | have eq_z_w : z = w := by apply normal_red <;> trivial | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
left✝ : refl_trans_clos R y w
right✝ : refl_trans_clos R z w
eq_y_w : y = w
⊢ y = z | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
left✝ : refl_trans_clos R y w
right✝ : refl_trans_clos R z w
eq_y_w : y = w
eq_z_w : z = w
... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | simp [*] | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
left✝ : refl_trans_clos R y w
right✝ : refl_trans_clos R z w
eq_y_w : y = w
eq_z_w : z = w
... | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | apply normal_red <;> trivial | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
left✝ : refl_trans_clos R y w
right✝ : refl_trans_clos R z w
⊢ y = w | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | confluent_unique_nf | [687, 1] | [697, 11] | apply normal_red <;> trivial | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
conf : confluent R
x y z : A
red_x_y : refl_trans_clos R x y
red_x_z : refl_trans_clos R x z
norm_y : normal R y
norm_z : normal R z
wdg_y_z : wedge R y z
w : A
left✝ : refl_trans_clos R y w
right✝ : refl_trans_clos R z w
eq_y_w : y = w
⊢ z = w | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | simp | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
⊢ ((fun R R' => ∀ (x y : A), R x y → R' x y) (fun x x_1 => R x x_1) fun x x_1 => S x x_1) →
((fun R R' => ∀ (x y : A), R x y → R' x y) (fun x x_1 => S x x_1) fun x x_1 => refl_trans_clos R x x_1) →
(fun R R' => ∀ (x y : A), R x y ↔ R' x y) (f... | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
⊢ (∀ (x y : A), R x y → S x y) →
(∀ (x y : A), S x y → refl_trans_clos R x y) → ∀ (x y : A), refl_trans_clos S x y ↔ refl_trans_clos R x y |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | intros r_sub_s s_sub_r_star x y | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
⊢ (∀ (x y : A), R x y → S x y) →
(∀ (x y : A), S x y → refl_trans_clos R x y) → ∀ (x y : A), refl_trans_clos S x y ↔ refl_trans_clos R x y | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y : A
⊢ refl_trans_clos S x y ↔ refl_trans_clos R x y |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | constructor <;> intros steps | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y : A
⊢ refl_trans_clos S x y ↔ refl_trans_clos R x y | case mp
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y : A
steps : refl_trans_clos S x y
⊢ refl_trans_clos R x y
case mpr
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s :... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | . induction steps
. constructor
. apply refl_trans_clos_transitive
. apply s_sub_r_star; trivial
. trivial | case mp
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y : A
steps : refl_trans_clos S x y
⊢ refl_trans_clos R x y
case mpr
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s :... | case mpr
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y : A
steps : refl_trans_clos R x y
⊢ refl_trans_clos S x y |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | . induction steps
. constructor
. aesop | case mpr
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y : A
steps : refl_trans_clos R x y
⊢ refl_trans_clos S x y | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | induction steps | case mp
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y : A
steps : refl_trans_clos S x y
⊢ refl_trans_clos R x y | case mp.refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝ : A
⊢ refl_trans_clos R a✝ a✝
case mp.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | . constructor | case mp.refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝ : A
⊢ refl_trans_clos R a✝ a✝
case mp.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R ... | case mp.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ refl_trans_clos R a✝² c✝ |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | . apply refl_trans_clos_transitive
. apply s_sub_r_star; trivial
. trivial | case mp.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ refl_trans_clos R a✝² c✝ | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | constructor | case mp.refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝ : A
⊢ refl_trans_clos R a✝ a✝ | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | apply refl_trans_clos_transitive | case mp.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ refl_trans_clos R a✝² c✝ | case mp.step.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ refl_trans_clos R a✝² ?mp.step.y
case mp.step... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | . apply s_sub_r_star; trivial | case mp.step.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ refl_trans_clos R a✝² ?mp.step.y
case mp.step... | case mp.step.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ refl_trans_clos R b✝ c✝ |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | . trivial | case mp.step.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ refl_trans_clos R b✝ c✝ | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | apply s_sub_r_star | case mp.step.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ refl_trans_clos R a✝² ?mp.step.y | case mp.step.a.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ S a✝² ?mp.step.y |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | trivial | case mp.step.a.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ S a✝² ?mp.step.y | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | trivial | case mp.step.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : S a✝² b✝
a✝ : refl_trans_clos S b✝ c✝
a_ih✝ : refl_trans_clos R b✝ c✝
⊢ refl_trans_clos R b✝ c✝ | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | induction steps | case mpr
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y : A
steps : refl_trans_clos R x y
⊢ refl_trans_clos S x y | case mpr.refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝ : A
⊢ refl_trans_clos S a✝ a✝
case mpr.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | . constructor | case mpr.refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝ : A
⊢ refl_trans_clos S a✝ a✝
case mpr.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), ... | case mpr.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : R a✝² b✝
a✝ : refl_trans_clos R b✝ c✝
a_ih✝ : refl_trans_clos S b✝ c✝
⊢ refl_trans_clos S a✝² c✝ |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | . aesop | case mpr.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : R a✝² b✝
a✝ : refl_trans_clos R b✝ c✝
a_ih✝ : refl_trans_clos S b✝ c✝
⊢ refl_trans_clos S a✝² c✝ | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | constructor | case mpr.refl
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝ : A
⊢ refl_trans_clos S a✝ a✝ | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | inc_refl_trans_eq | [704, 1] | [715, 12] | aesop | case mpr.step
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
r_sub_s : ∀ (x y : A), R x y → S x y
s_sub_r_star : ∀ (x y : A), S x y → refl_trans_clos R x y
x y a✝² b✝ c✝ : A
a✝¹ : R a✝² b✝
a✝ : refl_trans_clos R b✝ c✝
a_ih✝ : refl_trans_clos S b✝ c✝
⊢ refl_trans_clos S a✝² c✝ | no goals |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | simp | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
⊢ (fun R R' => ∀ (x y : A), R x y ↔ R' x y) S R → confluent S → confluent R | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
⊢ (∀ (x y : A), S x y ↔ R x y) → confluent S → confluent R |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | intros equiv | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
⊢ (∀ (x y : A), S x y ↔ R x y) → confluent S → confluent R | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
⊢ confluent S → confluent R |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | simp [confluent, wedge, joins] | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
⊢ confluent S → confluent R | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
⊢ (∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1) →
∀ (y z x : A),
refl_trans_clos R x y → refl_trans_clos R x z → ∃ z_1, refl_... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | intros h y z x red_x_y red_y_z | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
⊢ (∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1) →
∀ (y z x : A),
refl_trans_clos R x y → refl_trans_clos R x z → ∃ z_1, refl_... | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R x z
⊢ ∃ z_1, refl... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | have h1 : refl_trans_clos S x y := by
apply refl_trans_clos_monotone
intros _ _; apply (equiv _ _).2
trivial | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R x z
⊢ ∃ z_1, refl... | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R x z
h1 : refl_tra... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | have h2 : refl_trans_clos S x z := by
apply refl_trans_clos_monotone
intros _ _; apply (equiv _ _).2
trivial | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R x z
h1 : refl_tra... | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R x z
h1 : refl_tra... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | cases' (h y z x h1 h2) with w h | A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R x z
h1 : refl_tra... | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h✝ :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R x z
h... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | cases' h with h1 h2 | case intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h✝ :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R x z
h... | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | exists w | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R ... | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R ... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | constructor <;> apply refl_trans_clos_monotone | case intro.intro
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_clos R ... | case intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | . intros x y; apply (equiv _ _).1 | case intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_... | case intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | . trivial | case intro.intro.left.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans_... | case intro.intro.right.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans... |
https://github.com/codyroux/traat-lean.git | f2babab84f81d4003446f476790022ac175d7236 | Traat/chapter1.lean | equiv_conf | [717, 1] | [738, 12] | . intros x y; apply (equiv _ _).1 | case intro.intro.right.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans... | case intro.intro.right.a
A : Type
R : A → A → Prop
inhabited_A : Nonempty A
S : A → A → Prop
equiv : ∀ (x y : A), S x y ↔ R x y
h :
∀ (y z x : A),
refl_trans_clos S x y → refl_trans_clos S x z → ∃ z_1, refl_trans_clos S y z_1 ∧ refl_trans_clos S z z_1
y z x : A
red_x_y : refl_trans_clos R x y
red_y_z : refl_trans... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.