|   | 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 484 | . 2 ⊢ ((𝜑 ∧ 𝜓) → 𝜓) | |
| 3 | 1, 2 | bnj593 34759 | 1 ⊢ (𝜒 → ∃𝑥𝜓) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ∧ wa 395 ∃wex 1779 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 | 
| This theorem is referenced by: bnj1265 34826 | 
| Copyright terms: Public domain | W3C validator |