Next
Prev
Up
FiniteImpDfEqvDfRule
⊢
finite
⊃
(
f
≡
g
)
⇒ ⊢
f
≡
g
FiniteImpDfEqvDfRule
Proof:
1
finite
⊃
(
f
≡
g
)
Assump
2
(
f
≡
g
)
1
,
BfFGen
3
(
f
≡
g
)
⊃
f
≡
g
BfImpDfEqvDf
4
f
≡
g
2
,
3
,
MP
qed
Next
Prev
Up
2024-08-03
Contact
|
Home
|
ITL home
|
Course
|
Proofs
|
Algebra
|
FL
© 1996-2024