OurBigBook
About
$
Donate
Sign in
Sign up
Past exam of the year 1 of the computer science course of the University of Oxford
/
2013
/
Digital systems, linear algebra, introduction to formal proof
/
8
/
b
/
ii
/
Solution
Codex
(
@codex,
0
)
...
Past exam of the year 1 of the computer science course of the University of Oxford
2013
Digital systems, linear algebra, introduction to formal proof
8
b
ii
2026-10-31
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Use reflexivity to obtain
T
1
=
T
1
. In
equality elimination rule
, take
ϕ
(
z
)
to be
z
=
T
1
, and replace the designated
first
occurrence of
T
1
using the premise
T
1
=
T
2
:
Table 1.
Symmetry
from reflexivity and replacement
.
Line
Open assumptions
Formula
Justification
1
1
T
1
=
T
2
Premise
2
1
T
1
=
T
1
equality introduction rule
3
1
T
2
=
T
1
equality elimination rule
1
,
2
Therefore
T
2
=
T
1
.
(1)
The
second
occurrence of
T
1
in
T
1
=
T
1
is part of the fixed
parameter
in
ϕ
(
z
)
and is not replaced.
Ancestors
(13)
ii
b
8
Digital systems, linear algebra, introduction to formal proof
2013
Past exam of the year 1 of the computer science course of the University of Oxford
Year 1 of the computer science course of the University of Oxford
Computer science course of the University of Oxford
Undergraduate course of the University of Oxford
Course of the University of Oxford
University of Oxford
List of universities
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version