Theorem bnj519 34712

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.)

Hypothesis

Ref	Expression
bnj519.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
bnj519	⊢ (𝐵 ∈ V → Fun {⟨𝐴, 𝐵⟩})

Proof of Theorem bnj519

Step	Hyp	Ref	Expression
1		bnj519.1	. 2 ⊢ 𝐴 ∈ V
2		funsng 6629	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → Fun {⟨𝐴, 𝐵⟩})
3	1, 2	mpan 689	1 ⊢ (𝐵 ∈ V → Fun {⟨𝐴, 𝐵⟩})

Syntax hints:   → wi 4   ∈ wcel 2108  Vcvv 3488  {csn 4648  ⟨cop 4654  Fun wfun 6567

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-mo 2543  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-opab 5229  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-fun 6575

This theorem is referenced by:  bnj97  34842  bnj535  34866