Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1196 | 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 |
---|---|
bnj1196.1 | ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜓) |
Ref | Expression |
---|---|
bnj1196 | ⊢ (𝜑 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1196.1 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜓) | |
2 | df-rex 2902 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) | |
3 | 1, 2 | sylib 207 | 1 ⊢ (𝜑 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∃wex 1695 ∈ wcel 1977 ∃wrex 2897 |
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 196 df-rex 2902 |
This theorem is referenced by: bnj1209 30121 bnj1265 30137 bnj1379 30155 bnj1521 30175 bnj900 30253 bnj986 30278 bnj1189 30331 bnj1245 30336 bnj1286 30341 bnj1311 30346 bnj1450 30372 bnj1498 30383 |
Copyright terms: Public domain | W3C validator |