Can I do a conjunction in the antecedent of a conditional? i.e. step 7 in my derivation below legit?
- $A \rightarrow B\qquad\qquad$ (Premise)
- $A \rightarrow C\qquad\qquad$ (Premise)
- $A \phantom{{}\rightarrow C}\qquad\quad\quad$ (Premise)
- $B \phantom{{}\rightarrow C}\qquad\quad\quad$ (By 1 and 3, modus ponens)
- $C \phantom{{}\rightarrow C}\qquad\quad\quad$ (By 2 and 3, modus ponens)
- $A \wedge C\quad\quad\quad\qquad$ (By 3 and 5, conjunction)
- $(A \wedge C)\rightarrow B\quad\quad$ (By 1 and conjunction of the antecedent)
- Therefore $C \rightarrow B\quad$ (Conclusion) (Simplification of conjunction in step 7)
Is the following reasoning logically sound, to explain step 7?
a. $(A\wedge C)\rightarrow A\qquad\qquad$ (Simplification of conjunction in 6)
b. $A\rightarrow B\qquad\qquad\qquad$(Premise)
c. $(A\wedge C)\rightarrow A\rightarrow B\qquad$ (By a and b)
d. Therefore, $(A\wedge C)\rightarrow B\quad$ (Hypothetical syllogism)
Greatly appreciate any advice. Thanks!
< 10 Dec >
Hi everybody, many thanks for your inputs. After a good night's sleep, here I am at it again:
A: ε --> 0
B: f(x) --> L
C: δ --> 0
- A --> B (Premise 1)
- A --> C (Premise 2)
- A (Premise 3)
- B (1,3 MP)
- C (2,3 MP)
- A ⋀ C (3,5 conjunction)
- (A ⋀ C) --> A (6, simplification)
- (A ⋀ C) --> B (7,1 hypothetical syllogism)
- A --> (C --> B) (8, exportation)
- Therefore, C --> B (3,9 MP)
i.e. as δ --> 0, f(x) --> L
Problem seems solved in the interim.
Just need to convince myself that I can allow Premise 2 i.e. as ε --> 0, δ --> 0 (and vice versa, since I think the function that links ε and δ is bijective)