Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1266 | Structured version Visualization version GIF version |
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bnj1266.1 | ⊢ (𝜒 → ∃𝑥(𝜑 ∧ 𝜓)) |
Ref | Expression |
---|---|
bnj1266 | ⊢ (𝜒 → ∃𝑥𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1266.1 | . 2 ⊢ (𝜒 → ∃𝑥(𝜑 ∧ 𝜓)) | |
2 | simpr 485 | . 2 ⊢ ((𝜑 ∧ 𝜓) → 𝜓) | |
3 | 1, 2 | bnj593 32725 | 1 ⊢ (𝜒 → ∃𝑥𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∃wex 1782 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1783 |
This theorem is referenced by: bnj1265 32792 |
Copyright terms: Public domain | W3C validator |