| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > exancom | GIF version | ||
| Description: Commutation of conjunction inside an existential quantifier. (Contributed by NM, 18-Aug-1993.) |
| Ref | Expression |
|---|---|
| exancom | ⊢ (∃𝑥(𝜑 ∧ 𝜓) ↔ ∃𝑥(𝜓 ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ancom 266 | . 2 ⊢ ((𝜑 ∧ 𝜓) ↔ (𝜓 ∧ 𝜑)) | |
| 2 | 1 | exbii 1651 | 1 ⊢ (∃𝑥(𝜑 ∧ 𝜓) ↔ ∃𝑥(𝜓 ∧ 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∃wex 1538 |
| 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 1493 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-4 1556 ax-ial 1580 |
| This theorem depends on definitions: df-bi 117 |
| This theorem is referenced by: 19.29r 1667 19.42h 1733 19.42 1734 risset 2558 morex 2988 dfuni2 3893 eluni2 3895 unipr 3905 dfiun2g 4000 uniuni 4546 cnvco 4913 imadif 5407 funimaexglem 5410 pceu 12858 bdcuni 16407 bj-axun2 16446 |
| Copyright terms: Public domain | W3C validator |