| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1352 | 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 |
|---|---|
| bnj1352.1 | ⊢ (𝜓 → ∀𝑥𝜓) |
| Ref | Expression |
|---|---|
| bnj1352 | ⊢ ((𝜑 ∧ 𝜓) → ∀𝑥(𝜑 ∧ 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-5 1932 | . 2 ⊢ (𝜑 → ∀𝑥𝜑) | |
| 2 | bnj1352.1 | . 2 ⊢ (𝜓 → ∀𝑥𝜓) | |
| 3 | 1, 2 | hban 2336 | 1 ⊢ ((𝜑 ∧ 𝜓) → ∀𝑥(𝜑 ∧ 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∀wal 1560 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-10 2177 ax-12 2214 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1565 df-ex 1802 df-nf 1806 |
| This theorem is referenced by: bnj594 35209 bnj1309 35319 |
| Copyright terms: Public domain | W3C validator |