Nuprl - Proof: one one corr rel vs invfuns 1 1 1 1 2

(36steps total) Remark PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: one one corr rel vs invfuns 1 1 1 1 2

1. A : Type
2. B : Type
3. R : A

Prop
4.

x:A.

!y:B. R(x;y)
5.

y:B.

!x:A. R(x;y)
6. f : A

B
7.

x:A. R(x;f(x))
8. g : B

A
9.

y:B. R(g(y);y)

x:A, y:B. R(x;y)

y = f(x) & x = g(y)

By:

Auto

Generated subgoals:

1 10. x : A
11. y : B
12. R(x;y)
  y = f(x)
4 steps

2 10. x : A
11. y : B
12. R(x;y)
  x = g(y)
5 steps

3 10. x : A
11. y : B
12. y = f(x)
13. x = g(y)
  R(x;y)
1 step

About:

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(36steps total) Remark PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc

1	10. x : A 11. y : B 12. R(x;y) y = f(x)	4 steps
2	10. x : A 11. y : B 12. R(x;y) x = g(y)	5 steps
3	10. x : A 11. y : B 12. y = f(x) 13. x = g(y) R(x;y)	1 step