Theorem mptfng 6700

Description: The maps-to notation defines a function with domain. (Contributed by Scott Fenton, 21-Mar-2011.)

Hypothesis

Ref	Expression
mptfng.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)

Assertion

Ref	Expression
mptfng	⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ 𝐹 Fn 𝐴)

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem mptfng

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eueq 3669	. . 3 ⊢ (𝐵 ∈ V ↔ ∃!𝑦 𝑦 = 𝐵)
2	1	ralbii 3112	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑦 = 𝐵)
3		mptfng.1	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
4		df-mpt 5190	. . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
5	3, 4	eqtri 2786	. . 3 ⊢ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
6	5	fnopabg 6698	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦 𝑦 = 𝐵 ↔ 𝐹 Fn 𝐴)
7	2, 6	bitri 278	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ 𝐹 Fn 𝐴)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃!weu 2596  ∀wral 3080  Vcvv 3454  {copab 5170   ↦ cmpt 5189   Fn wfn 6553

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-fun 6560  df-fn 6561

This theorem is used by:  fnmpt  6701  fnmpti  6704  mpteqb  7036  ofmpteq  7740  bdayfo  28064  fobigcup  36840  dihf11lem  42515