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

Theorem fnres 6627
Description: An equivalence for functionality of a restriction. Compare dffun8 6528. (Contributed by Mario Carneiro, 20-May-2015.) (Proof shortened by Peter Mazsa, 2-Oct-2022.)
Assertion
Ref Expression
fnres ((𝐹𝐴) Fn 𝐴 ↔ ∀𝑥𝐴 ∃!𝑦 𝑥𝐹𝑦)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦

Proof of Theorem fnres
StepHypRef Expression
1 ancom 460 . . 3 ((∀𝑥𝐴 ∃*𝑦 𝑥𝐹𝑦 ∧ ∀𝑥𝐴𝑦 𝑥𝐹𝑦) ↔ (∀𝑥𝐴𝑦 𝑥𝐹𝑦 ∧ ∀𝑥𝐴 ∃*𝑦 𝑥𝐹𝑦))
2 vex 3446 . . . . . . . . 9 𝑦 ∈ V
32brresi 5955 . . . . . . . 8 (𝑥(𝐹𝐴)𝑦 ↔ (𝑥𝐴𝑥𝐹𝑦))
43mobii 2549 . . . . . . 7 (∃*𝑦 𝑥(𝐹𝐴)𝑦 ↔ ∃*𝑦(𝑥𝐴𝑥𝐹𝑦))
5 moanimv 2620 . . . . . . 7 (∃*𝑦(𝑥𝐴𝑥𝐹𝑦) ↔ (𝑥𝐴 → ∃*𝑦 𝑥𝐹𝑦))
64, 5bitri 275 . . . . . 6 (∃*𝑦 𝑥(𝐹𝐴)𝑦 ↔ (𝑥𝐴 → ∃*𝑦 𝑥𝐹𝑦))
76albii 1821 . . . . 5 (∀𝑥∃*𝑦 𝑥(𝐹𝐴)𝑦 ↔ ∀𝑥(𝑥𝐴 → ∃*𝑦 𝑥𝐹𝑦))
8 relres 5972 . . . . . 6 Rel (𝐹𝐴)
9 dffun6 6511 . . . . . 6 (Fun (𝐹𝐴) ↔ (Rel (𝐹𝐴) ∧ ∀𝑥∃*𝑦 𝑥(𝐹𝐴)𝑦))
108, 9mpbiran 710 . . . . 5 (Fun (𝐹𝐴) ↔ ∀𝑥∃*𝑦 𝑥(𝐹𝐴)𝑦)
11 df-ral 3053 . . . . 5 (∀𝑥𝐴 ∃*𝑦 𝑥𝐹𝑦 ↔ ∀𝑥(𝑥𝐴 → ∃*𝑦 𝑥𝐹𝑦))
127, 10, 113bitr4i 303 . . . 4 (Fun (𝐹𝐴) ↔ ∀𝑥𝐴 ∃*𝑦 𝑥𝐹𝑦)
13 dmres 5979 . . . . . . 7 dom (𝐹𝐴) = (𝐴 ∩ dom 𝐹)
14 inss1 4191 . . . . . . 7 (𝐴 ∩ dom 𝐹) ⊆ 𝐴
1513, 14eqsstri 3982 . . . . . 6 dom (𝐹𝐴) ⊆ 𝐴
16 eqss 3951 . . . . . 6 (dom (𝐹𝐴) = 𝐴 ↔ (dom (𝐹𝐴) ⊆ 𝐴𝐴 ⊆ dom (𝐹𝐴)))
1715, 16mpbiran 710 . . . . 5 (dom (𝐹𝐴) = 𝐴𝐴 ⊆ dom (𝐹𝐴))
18 dfss3 3924 . . . . . 6 (𝐴 ⊆ dom (𝐹𝐴) ↔ ∀𝑥𝐴 𝑥 ∈ dom (𝐹𝐴))
1913elin2 4157 . . . . . . . . 9 (𝑥 ∈ dom (𝐹𝐴) ↔ (𝑥𝐴𝑥 ∈ dom 𝐹))
2019baib 535 . . . . . . . 8 (𝑥𝐴 → (𝑥 ∈ dom (𝐹𝐴) ↔ 𝑥 ∈ dom 𝐹))
21 vex 3446 . . . . . . . . 9 𝑥 ∈ V
2221eldm 5857 . . . . . . . 8 (𝑥 ∈ dom 𝐹 ↔ ∃𝑦 𝑥𝐹𝑦)
2320, 22bitrdi 287 . . . . . . 7 (𝑥𝐴 → (𝑥 ∈ dom (𝐹𝐴) ↔ ∃𝑦 𝑥𝐹𝑦))
2423ralbiia 3082 . . . . . 6 (∀𝑥𝐴 𝑥 ∈ dom (𝐹𝐴) ↔ ∀𝑥𝐴𝑦 𝑥𝐹𝑦)
2518, 24bitri 275 . . . . 5 (𝐴 ⊆ dom (𝐹𝐴) ↔ ∀𝑥𝐴𝑦 𝑥𝐹𝑦)
2617, 25bitri 275 . . . 4 (dom (𝐹𝐴) = 𝐴 ↔ ∀𝑥𝐴𝑦 𝑥𝐹𝑦)
2712, 26anbi12i 629 . . 3 ((Fun (𝐹𝐴) ∧ dom (𝐹𝐴) = 𝐴) ↔ (∀𝑥𝐴 ∃*𝑦 𝑥𝐹𝑦 ∧ ∀𝑥𝐴𝑦 𝑥𝐹𝑦))
28 r19.26 3098 . . 3 (∀𝑥𝐴 (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦) ↔ (∀𝑥𝐴𝑦 𝑥𝐹𝑦 ∧ ∀𝑥𝐴 ∃*𝑦 𝑥𝐹𝑦))
291, 27, 283bitr4i 303 . 2 ((Fun (𝐹𝐴) ∧ dom (𝐹𝐴) = 𝐴) ↔ ∀𝑥𝐴 (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦))
30 df-fn 6503 . 2 ((𝐹𝐴) Fn 𝐴 ↔ (Fun (𝐹𝐴) ∧ dom (𝐹𝐴) = 𝐴))
31 df-eu 2570 . . 3 (∃!𝑦 𝑥𝐹𝑦 ↔ (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦))
3231ralbii 3084 . 2 (∀𝑥𝐴 ∃!𝑦 𝑥𝐹𝑦 ↔ ∀𝑥𝐴 (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦))
3329, 30, 323bitr4i 303 1 ((𝐹𝐴) Fn 𝐴 ↔ ∀𝑥𝐴 ∃!𝑦 𝑥𝐹𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wal 1540   = wceq 1542  wex 1781  wcel 2114  ∃*wmo 2538  ∃!weu 2569  wral 3052  cin 3902  wss 3903   class class class wbr 5100  dom cdm 5632  cres 5634  Rel wrel 5637  Fun wfun 6494   Fn wfn 6495
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-ext 2709  ax-sep 5243  ax-pr 5379
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-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-res 5644  df-fun 6502  df-fn 6503
This theorem is referenced by:  f1ompt  7065  omxpenlem  9018  noinfepregs  35308  tz6.12-afv  47527  tz6.12-afv2  47594
  Copyright terms: Public domain W3C validator