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

Theorem mptfnf 6015
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 3378 . . 3 (𝐵 ∈ V ↔ ∃!𝑦 𝑦 = 𝐵)
21ralbii 2980 . 2 (∀𝑥𝐴 𝐵 ∈ V ↔ ∀𝑥𝐴 ∃!𝑦 𝑦 = 𝐵)
3 r19.26 3064 . . 3 (∀𝑥𝐴 (∃𝑦 𝑦 = 𝐵 ∧ ∃*𝑦 𝑦 = 𝐵) ↔ (∀𝑥𝐴𝑦 𝑦 = 𝐵 ∧ ∀𝑥𝐴 ∃*𝑦 𝑦 = 𝐵))
4 eu5 2496 . . . 4 (∃!𝑦 𝑦 = 𝐵 ↔ (∃𝑦 𝑦 = 𝐵 ∧ ∃*𝑦 𝑦 = 𝐵))
54ralbii 2980 . . 3 (∀𝑥𝐴 ∃!𝑦 𝑦 = 𝐵 ↔ ∀𝑥𝐴 (∃𝑦 𝑦 = 𝐵 ∧ ∃*𝑦 𝑦 = 𝐵))
6 df-mpt 4730 . . . . . 6 (𝑥𝐴𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
76fneq1i 5985 . . . . 5 ((𝑥𝐴𝐵) Fn 𝐴 ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} Fn 𝐴)
8 df-fn 5891 . . . . 5 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} Fn 𝐴 ↔ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = 𝐴))
97, 8bitri 264 . . . 4 ((𝑥𝐴𝐵) Fn 𝐴 ↔ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = 𝐴))
10 moanimv 2531 . . . . . . 7 (∃*𝑦(𝑥𝐴𝑦 = 𝐵) ↔ (𝑥𝐴 → ∃*𝑦 𝑦 = 𝐵))
1110albii 1747 . . . . . 6 (∀𝑥∃*𝑦(𝑥𝐴𝑦 = 𝐵) ↔ ∀𝑥(𝑥𝐴 → ∃*𝑦 𝑦 = 𝐵))
12 funopab 5923 . . . . . 6 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} ↔ ∀𝑥∃*𝑦(𝑥𝐴𝑦 = 𝐵))
13 df-ral 2917 . . . . . 6 (∀𝑥𝐴 ∃*𝑦 𝑦 = 𝐵 ↔ ∀𝑥(𝑥𝐴 → ∃*𝑦 𝑦 = 𝐵))
1411, 12, 133bitr4ri 293 . . . . 5 (∀𝑥𝐴 ∃*𝑦 𝑦 = 𝐵 ↔ Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)})
15 eqcom 2629 . . . . . 6 ({𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)} = 𝐴𝐴 = {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)})
16 dmopab 5335 . . . . . . . 8 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = {𝑥 ∣ ∃𝑦(𝑥𝐴𝑦 = 𝐵)}
17 19.42v 1918 . . . . . . . . 9 (∃𝑦(𝑥𝐴𝑦 = 𝐵) ↔ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵))
1817abbii 2739 . . . . . . . 8 {𝑥 ∣ ∃𝑦(𝑥𝐴𝑦 = 𝐵)} = {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)}
1916, 18eqtri 2644 . . . . . . 7 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)}
2019eqeq1i 2627 . . . . . 6 (dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = 𝐴 ↔ {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)} = 𝐴)
21 pm4.71 662 . . . . . . . 8 ((𝑥𝐴 → ∃𝑦 𝑦 = 𝐵) ↔ (𝑥𝐴 ↔ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)))
2221albii 1747 . . . . . . 7 (∀𝑥(𝑥𝐴 → ∃𝑦 𝑦 = 𝐵) ↔ ∀𝑥(𝑥𝐴 ↔ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)))
23 df-ral 2917 . . . . . . 7 (∀𝑥𝐴𝑦 𝑦 = 𝐵 ↔ ∀𝑥(𝑥𝐴 → ∃𝑦 𝑦 = 𝐵))
24 mptfnf.0 . . . . . . . 8 𝑥𝐴
2524abeq2f 2792 . . . . . . 7 (𝐴 = {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)} ↔ ∀𝑥(𝑥𝐴 ↔ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)))
2622, 23, 253bitr4i 292 . . . . . 6 (∀𝑥𝐴𝑦 𝑦 = 𝐵𝐴 = {𝑥 ∣ (𝑥𝐴 ∧ ∃𝑦 𝑦 = 𝐵)})
2715, 20, 263bitr4ri 293 . . . . 5 (∀𝑥𝐴𝑦 𝑦 = 𝐵 ↔ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = 𝐴)
2814, 27anbi12i 733 . . . 4 ((∀𝑥𝐴 ∃*𝑦 𝑦 = 𝐵 ∧ ∀𝑥𝐴𝑦 𝑦 = 𝐵) ↔ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} ∧ dom {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = 𝐴))
29 ancom 466 . . . 4 ((∀𝑥𝐴 ∃*𝑦 𝑦 = 𝐵 ∧ ∀𝑥𝐴𝑦 𝑦 = 𝐵) ↔ (∀𝑥𝐴𝑦 𝑦 = 𝐵 ∧ ∀𝑥𝐴 ∃*𝑦 𝑦 = 𝐵))
309, 28, 293bitr2i 288 . . 3 ((𝑥𝐴𝐵) Fn 𝐴 ↔ (∀𝑥𝐴𝑦 𝑦 = 𝐵 ∧ ∀𝑥𝐴 ∃*𝑦 𝑦 = 𝐵))
313, 5, 303bitr4ri 293 . 2 ((𝑥𝐴𝐵) Fn 𝐴 ↔ ∀𝑥𝐴 ∃!𝑦 𝑦 = 𝐵)
322, 31bitr4i 267 1 (∀𝑥𝐴 𝐵 ∈ V ↔ (𝑥𝐴𝐵) Fn 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  wal 1481   = wceq 1483  wex 1704  wcel 1990  ∃!weu 2470  ∃*wmo 2471  {cab 2608  wnfc 2751  wral 2912  Vcvv 3200  {copab 4712  cmpt 4729  dom cdm 5114  Fun wfun 5882   Fn wfn 5883
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-fun 5890  df-fn 5891
This theorem is referenced by:  fnmptf  6016  mptfnd  39451
  Copyright terms: Public domain W3C validator