Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

This question is a proof/logic-based question and it is done with a program called lean which checks to see if you proved it correctly. I

This question is a proof/logic-based question and it is done with a program called lean which checks to see if you proved it correctly. I have done the first one in lean, but Im not sure how to do the others if someone could help me it would be greatly appreciated. (note: The answer should be in lean format like the first problem)

variables A B C D : Prop

  1. example : A (A B) B :=

assume h: A (A B),

have a : A, from and.left h,

have f: A B, from and.right h,

have b: B, from f a,

show B, from b

  1. example : A ( A B) :=

  1. example : (A B) (A B) :=

  1. example (h : A B) (i : A C) (j : B D) : C D :=

  1. example (h : A B) : (A B) :=

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database And Expert Systems Applications 15th International Conference Dexa 2004 Zaragoza Spain August 30 September 3 2004 Proceedings Lncs 3180

Authors: Fernando Galindo ,Makoto Takizawa ,Roland Traunmuller

2004th Edition

3540229361, 978-3540229360

More Books

Students also viewed these Databases questions

Question

Fingerprint evidence is admissible in court. Should it be?

Answered: 1 week ago