| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > exintr | GIF version | ||
| Description: Introduce a conjunct in the scope of an existential quantifier. (Contributed by NM, 11-Aug-1993.) | 
| Ref | Expression | 
|---|---|
| exintr | ⊢ (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑 ∧ 𝜓))) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | exintrbi 1647 | . 2 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 ↔ ∃𝑥(𝜑 ∧ 𝜓))) | |
| 2 | 1 | biimpd 144 | 1 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑 ∧ 𝜓))) | 
| Colors of variables: wff set class | 
| Syntax hints: → wi 4 ∧ wa 104 ∀wal 1362 ∃wex 1506 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1461 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-4 1524 ax-ial 1548 | 
| This theorem depends on definitions: df-bi 117 | 
| This theorem is referenced by: ceqsex 2801 r19.2m 3537 r19.2mOLD 3538 | 
| Copyright terms: Public domain | W3C validator |