2013-09-03 17:44:51 +00:00
|
|
|
Set: pp::colors
|
|
|
|
|
Set: pp::unicode
|
2013-09-01 02:15:48 +00:00
|
|
|
Assumed: f
|
|
|
|
|
Assumed: N
|
|
|
|
|
Assumed: n1
|
|
|
|
|
Assumed: n2
|
2013-09-02 19:29:21 +00:00
|
|
|
Set: lean::pp::implicit
|
2013-12-22 01:02:16 +00:00
|
|
|
@f N n1 n2
|
|
|
|
|
@f ((N → N) → N → N) (λ x : N → N, x) (λ y : N → N, y)
|
2013-09-01 02:15:48 +00:00
|
|
|
Assumed: EqNice
|
2013-12-22 01:02:16 +00:00
|
|
|
@EqNice N n1 n2
|
|
|
|
|
@f N n1 n2 : N
|
2014-01-08 08:38:39 +00:00
|
|
|
@congr : ∀ (A : TypeU) (B : A → TypeU) (f g : ∀ x : A, B x) (a b : A), f == g → a == b → f a == g b
|
2013-12-22 01:02:16 +00:00
|
|
|
@f N n1 n2
|
2013-09-01 02:15:48 +00:00
|
|
|
Assumed: a
|
|
|
|
|
Assumed: b
|
|
|
|
|
Assumed: c
|
|
|
|
|
Assumed: g
|
|
|
|
|
Assumed: H1
|
|
|
|
|
Proved: Pr
|
2014-01-05 20:05:08 +00:00
|
|
|
axiom H1 : @eq N a b ∧ @eq N b c
|
|
|
|
|
theorem Pr : @eq N (g a) (g c) :=
|
2014-01-06 03:10:21 +00:00
|
|
|
@congr N
|
2013-12-22 01:02:16 +00:00
|
|
|
(λ x : N, N)
|
|
|
|
|
g
|
|
|
|
|
g
|
|
|
|
|
a
|
|
|
|
|
c
|
2014-01-06 03:10:21 +00:00
|
|
|
(@refl (N → N) g)
|
|
|
|
|
(@trans N a b c (and::@eliml (@eq N a b) (@eq N b c) H1) (and::@elimr (@eq N a b) (@eq N b c) H1))
|
