Theorem datisi 2010

Description: "Datisi", one of the syllogisms of Aristotelian logic. All 𝜑 is 𝜓, and some 𝜑 is 𝜒, therefore some 𝜒 is 𝜓. (In Aristotelian notation, AII-3: MaP and MiS therefore SiP.) (Contributed by David A. Wheeler, 28-Aug-2016.)

Hypotheses

Ref	Expression
datisi.maj	⊢ ∀𝑥(𝜑 → 𝜓)
datisi.min	⊢ ∃𝑥(𝜑 ∧ 𝜒)

Assertion

Ref	Expression
datisi	⊢ ∃𝑥(𝜒 ∧ 𝜓)

Proof of Theorem datisi

Step	Hyp	Ref	Expression
1		datisi.min	. 2 ⊢ ∃𝑥(𝜑 ∧ 𝜒)
2		simpr 103	. . 3 ⊢ ((𝜑 ∧ 𝜒) → 𝜒)
3		datisi.maj	. . . . 5 ⊢ ∀𝑥(𝜑 → 𝜓)
4	3	spi 1429	. . . 4 ⊢ (𝜑 → 𝜓)
5	4	adantr 261	. . 3 ⊢ ((𝜑 ∧ 𝜒) → 𝜓)
6	2, 5	jca 290	. 2 ⊢ ((𝜑 ∧ 𝜒) → (𝜒 ∧ 𝜓))
7	1, 6	eximii 1493	1 ⊢ ∃𝑥(𝜒 ∧ 𝜓)

Syntax hints:   → wi 4   ∧ wa 97  ∀wal 1241  ∃wex 1381

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-ial 1427

This theorem depends on definitions:  df-bi 110

This theorem is referenced by:  ferison  2012