MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mptfnf Structured version   Visualization version   GIF version

Theorem mptfnf 6677
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.
StepHypRef Expression
1 eueq 3665 . . 3 (𝐵 ∈ V ↔ ∃!𝑦 𝑦 = 𝐵)
21ralbii 3108 . 2 (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑦 = 𝐵)
3 r19.26 3122 . . 3 (∀𝑥 ∈ 𝐴 (∃𝑦 𝑦 = 𝐵 ∧ ∃*𝑦 𝑦 = 𝐵) ↔ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵))
4 df-eu 2594 . . . 4 (∃!𝑦 𝑦 = 𝐵 ↔ (∃𝑦 𝑦 = 𝐵 ∧ ∃*𝑦 𝑦 = 𝐵))
54ralbii 3108 . . 3 (∀𝑥 ∈ 𝐴 ∃!𝑦 𝑦 = 𝐵 ↔ ∀𝑥 ∈ 𝐴 (∃𝑦 𝑦 = 𝐵 ∧ ∃*𝑦 𝑦 = 𝐵))
6 df-mpt 5186 . . . . . 6 (𝑥 ∈ 𝐴 ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
76fneq1i 6639 . . . . 5 ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} Fn 𝐴)
8 df-fn 6544 . . . . 5 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} Fn 𝐴 ↔ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴))
97, 8bitri 278 . . . 4 ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴))
10 moanimv 2644 . . . . . . 7 (∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐴 → ∃*𝑦 𝑦 = 𝐵))
1110albii 1851 . . . . . 6 (∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦 𝑦 = 𝐵))
12 funopab 6578 . . . . . 6 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵))
13 df-ral 3077 . . . . . 6 (∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦 𝑦 = 𝐵))
1411, 12, 133bitr4ri 307 . . . . 5 (∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵 ↔ Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)})
15 eqcom 2767 . . . . . 6 ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)} = 𝐴 ↔ 𝐴 = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)})
16 dmopab 5897 . . . . . . . 8 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
17 19.42v 1985 . . . . . . . . 9 (∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
1817abbii 2827 . . . . . . . 8 {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)}
1916, 18eqtri 2783 . . . . . . 7 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)}
2019eqeq1i 2765 . . . . . 6 (dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴 ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)} = 𝐴)
21 pm4.71 567 . . . . . . . 8 ((𝑥 ∈ 𝐴 → ∃𝑦 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)))
2221albii 1851 . . . . . . 7 (∀𝑥(𝑥 ∈ 𝐴 → ∃𝑦 𝑦 = 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)))
23 df-ral 3077 . . . . . . 7 (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃𝑦 𝑦 = 𝐵))
24 mptfnf.0 . . . . . . . 8 Ⅎ𝑥𝐴
2524eqabf 2951 . . . . . . 7 (𝐴 = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)))
2622, 23, 253bitr4i 306 . . . . . 6 (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ↔ 𝐴 = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)})
2715, 20, 263bitr4ri 307 . . . . 5 (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ↔ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴)
2814, 27anbi12i 640 . . . 4 ((∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵) ↔ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = 𝐴))
29 ancom 466 . . . 4 ((∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵) ↔ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵))
309, 28, 293bitr2i 302 . . 3 ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑦 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 𝑦 = 𝐵))
313, 5, 303bitr4ri 307 . 2 ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑦 = 𝐵)
322, 31bitr4i 281 1 (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃*wmo 2562  ∃!weu 2593  {cab 2738  Ⅎwnfc 2907  ∀wral 3076  Vcvv 3450  {copab 5166   ↦ cmpt 5185  dom cdm 5650  Fun wfun 6535   Fn wfn 6536
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-fun 6543  df-fn 6544
This theorem is used by:  fnmptf  6678  mptfnd  46361  fnmptif  46384  sqrtnnaa  48020  sqrtnzqaa  48021  sqrtnpoly  48050  tmachlem-extpcover  48062
  Copyright terms: Public domain W3C validator