| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj519 | Structured version Visualization version GIF version | ||
| Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Revised by Mario Carneiro, 6-May-2015.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj519.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| bnj519 | ⊢ (𝐵 ∈ V → Fun {〈𝐴, 𝐵〉}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj519.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | funsng 6542 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → Fun {〈𝐴, 𝐵〉}) | |
| 3 | 1, 2 | mpan 691 | 1 ⊢ (𝐵 ∈ V → Fun {〈𝐴, 𝐵〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2114 Vcvv 3439 {csn 4579 〈cop 4585 Fun wfun 6485 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pr 5376 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-mo 2538 df-clab 2714 df-cleq 2727 df-clel 2810 df-ral 3051 df-rex 3060 df-rab 3399 df-v 3441 df-dif 3903 df-un 3905 df-ss 3917 df-nul 4285 df-if 4479 df-sn 4580 df-pr 4582 df-op 4586 df-br 5098 df-opab 5160 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-fun 6493 |
| This theorem is referenced by: bnj97 35001 bnj535 35025 |
| Copyright terms: Public domain | W3C validator |