Theorem mptfnf 6633

Description: The maps-to notation defines a function with domain. (Contributed by Scott Fenton, 21-Mar-2011.) (Revised by Thierry Arnoux, 10-May-2017.)

Hypothesis

Ref	Expression
mptfnf.0	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
mptfnf	⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)

Proof of Theorem mptfnf

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eueq 3654	. . 3 ⊢ (𝐵 ∈ V ↔ ∃!𝑦 𝑦 = 𝐵)
2	1	ralbii 3083	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑦 = 𝐵)
3		r19.26 3097	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (∃𝑦 𝑦 = 𝐵 ∧ ∃*𝑦 𝑦 = 𝐵) ↔ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵))
4		df-eu 2569	. . . 4 ⊢ (∃!𝑦 𝑦 = 𝐵 ↔ (∃𝑦 𝑦 = 𝐵 ∧ ∃*𝑦 𝑦 = 𝐵))
5	4	ralbii 3083	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦 𝑦 = 𝐵 ↔ ∀𝑥 ∈ 𝐴 (∃𝑦 𝑦 = 𝐵 ∧ ∃*𝑦 𝑦 = 𝐵))
6		df-mpt 5167	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
7	6	fneq1i 6595	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} Fn 𝐴)
8		df-fn 6501	. . . . 5 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} Fn 𝐴 ↔ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴))
9	7, 8	bitri 275	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴))
10		moanimv 2619	. . . . . . 7 ⊢ (∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐴 → ∃*𝑦 𝑦 = 𝐵))
11	10	albii 1821	. . . . . 6 ⊢ (∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦 𝑦 = 𝐵))
12		funopab 6533	. . . . . 6 ⊢ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵))
13		df-ral 3052	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦 𝑦 = 𝐵))
14	11, 12, 13	3bitr4ri 304	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵 ↔ Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)})
15		eqcom 2743	. . . . . 6 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)} = 𝐴 ↔ 𝐴 = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)})
16		dmopab 5870	. . . . . . . 8 ⊢ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
17		19.42v 1955	. . . . . . . . 9 ⊢ (∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
18	17	abbii 2803	. . . . . . . 8 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)}
19	16, 18	eqtri 2759	. . . . . . 7 ⊢ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)}
20	19	eqeq1i 2741	. . . . . 6 ⊢ (dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴 ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)} = 𝐴)
21		pm4.71 557	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 → ∃𝑦 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)))
22	21	albii 1821	. . . . . . 7 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → ∃𝑦 𝑦 = 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)))
23		df-ral 3052	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃𝑦 𝑦 = 𝐵))
24		mptfnf.0	. . . . . . . 8 ⊢ Ⅎ𝑥𝐴
25	24	eqabf 2928	. . . . . . 7 ⊢ (𝐴 = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)))
26	22, 23, 25	3bitr4i 303	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ↔ 𝐴 = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)})
27	15, 20, 26	3bitr4ri 304	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ↔ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴)
28	14, 27	anbi12i 629	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵) ↔ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴))
29		ancom 460	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵) ↔ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵))
30	9, 28, 29	3bitr2i 299	. . 3 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵))
31	3, 5, 30	3bitr4ri 304	. 2 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑦 = 𝐵)
32	2, 31	bitr4i 278	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1540   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∃*wmo 2537  ∃!weu 2568  {cab 2714  Ⅎwnfc 2883  ∀wral 3051  Vcvv 3429  {copab 5147   ↦ cmpt 5166  dom cdm 5631  Fun wfun 6492   Fn wfn 6493

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-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-pr 5375

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-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-fun 6500  df-fn 6501

This theorem is referenced by:  fnmptf  6634  mptfnd  45671  fnmptif  45694  nthrucw  47316  sinnpoly  47339