Skip to content

Commit 6f2a108

Browse files
committed
fix output
1 parent feabe4c commit 6f2a108

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

test-suite/output/PrintInfos.out

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -84,15 +84,15 @@ Arguments bar {x}
8484
Module Corelib.Init.Peano
8585
Notation sym_eq := eq_sym
8686
Expands to: Notation Corelib.Init.Logic.sym_eq
87-
Declared in library Corelib.Init.Logic, line 800, characters 0-45
87+
Declared in library Corelib.Init.Logic, line 835, characters 0-45
8888

8989
eq_sym : forall [A : Type] [x y : A], x = y -> y = x
9090

9191
eq_sym is not universe polymorphic
9292
Arguments eq_sym [A]%_type_scope [x y] _
9393
eq_sym is transparent
9494
Expands to: Constant Corelib.Init.Logic.eq_sym
95-
Declared in library Corelib.Init.Logic, line 443, characters 12-18
95+
Declared in library Corelib.Init.Logic, line 459, characters 12-18
9696
Inductive eq (A : Type) (x : A) : A -> Prop := eq_refl : x = x.
9797

9898
Arguments eq {A}%_type_scope x _

test-suite/output/PrintingParentheses.out

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ nat_ind (fun n0 : nat => ((n0 * m) + n0) = (n0 * (S m)))
88
(let n0 := p * (S m) in
99
match H in _ = n1 return ((m + (p * m)) + (S p)) = (S (m + n1)) with
1010
| eq_refl =>
11-
eq_Has_Leibniz_elim (fun n1 : nat => n1 = (S (m + ((p * m) + p))))
11+
eq_Has_Leibniz_elimP (fun n1 : nat => n1 = (S (m + ((p * m) + p))))
1212
(eq_S ((m + (p * m)) + p) (m + ((p * m) + p))
1313
(nat_ind
1414
(fun n1 : nat => ((n1 + (p * m)) + p) = (n1 + ((p * m) + p)))

0 commit comments

Comments
 (0)