Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1232 | 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 |
---|---|
bnj1232.1 | ⊢ (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏)) |
Ref | Expression |
---|---|
bnj1232 | ⊢ (𝜑 → 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1232.1 | . 2 ⊢ (𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏)) | |
2 | bnj642 32129 | . 2 ⊢ ((𝜓 ∧ 𝜒 ∧ 𝜃 ∧ 𝜏) → 𝜓) | |
3 | 1, 2 | sylbi 220 | 1 ⊢ (𝜑 → 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ w-bnj17 32066 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 210 df-an 400 df-3an 1086 df-bnj17 32067 |
This theorem is referenced by: bnj605 32289 bnj607 32298 bnj944 32320 bnj969 32328 bnj970 32329 bnj1001 32341 bnj1110 32364 bnj1118 32366 bnj1128 32372 bnj1145 32375 bnj1311 32406 |
Copyright terms: Public domain | W3C validator |