| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj101 | 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 |
|---|---|
| bnj101.1 | ⊢ ∃𝑥𝜑 |
| bnj101.2 | ⊢ (𝜑 → 𝜓) |
| Ref | Expression |
|---|---|
| bnj101 | ⊢ ∃𝑥𝜓 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj101.1 | . 2 ⊢ ∃𝑥𝜑 | |
| 2 | bnj101.2 | . 2 ⊢ (𝜑 → 𝜓) | |
| 3 | 1, 2 | eximii 1866 | 1 ⊢ ∃𝑥𝜓 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∃wex 1808 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 |
| This proof depends on definitions: df-bi 210 df-ex 1809 |
| This theorem is used by: bnj1023 35178 bnj1098 35181 bnj1101 35182 bnj1109 35184 bnj1468 35243 bnj907 35364 bnj1110 35379 bnj1118 35381 bnj1128 35387 bnj1145 35390 bnj1172 35398 bnj1174 35400 bnj1176 35402 |
| Copyright terms: Public domain | W3C validator |