(3steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc
At:
inverse-biject
A,B:Type, f:(A
B). Bij(A; B; f)
(
g:(B
A). Bij(B; A; g) & InvFuns(A; B; f; g))
By:
Auto
THEN
AllHyps (
h. FwdThru
Thm*
f:(A
B). Bij(A; B; f)
(
g:(B
A). InvFuns(A; B; f; g)) [h])
THEN
ExRepD
THEN
AllHyps (
h.FwdThru Thm*
f:(A
B), g:(B
A). InvFuns(A; B; f; g)
InvFuns(B; A; g; f) [h])
Generated subgoal:
1
1.
A:
Type
2.
B:
Type
3.
f:
A
B
4.
Bij(A; B; f)
5.
g:
B
A
6.
InvFuns(A; B; f; g)
7.
InvFuns(B; A; g; f)
g:(B
A). Bij(B; A; g) & InvFuns(A; B; f; g)
2
steps
About:
(3steps total)
PrintForm
Definitions
Lemmas
graph
1
1
Sections
Graphs
Doc