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

Theorem funcnvmpt 6995
Description: Condition for a function in maps-to notation to be single-rooted. (Contributed by Thierry Arnoux, 28-Feb-2017.) (Proof shortened by Peter Mazsa, 24-Feb-2026.)
Hypotheses
Ref Expression
funcnvmpt.0 Ⅎ𝑥𝜑
funcnvmpt.1 Ⅎ𝑥𝐴
funcnvmpt.2 Ⅎ𝑥𝐹
funcnvmpt.3 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
funcnvmpt.4 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
Assertion
Ref Expression
funcnvmpt (𝜑 → (Fun ◡𝐹 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 = 𝐵))
Distinct variable groups:   𝑥,𝑦   𝑦,𝐹   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥, 𝑦)   𝐵(𝑥, 𝑦)   𝐹(𝑥)   𝑉(𝑥, 𝑦)

Proof of Theorem funcnvmpt
StepHypRef Expression
1 relcnv 6099 . . . 4 Rel ◡𝐹
2 nfcv 2922 . . . . 5 Ⅎ𝑦◡𝐹
3 funcnvmpt.2 . . . . . 6 Ⅎ𝑥𝐹
43nfcnv 5855 . . . . 5 Ⅎ𝑥◡𝐹
52, 4dffun6f 6553 . . . 4 (Fun ◡𝐹 ↔ (Rel ◡𝐹 ∧ ∀𝑦∃*𝑥 𝑦◡𝐹𝑥))
61, 5mpbiran 722 . . 3 (Fun ◡𝐹 ↔ ∀𝑦∃*𝑥 𝑦◡𝐹𝑥)
7 vex 3454 . . . . . 6 𝑦 ∈ V
8 vex 3454 . . . . . 6 𝑥 ∈ V
97, 8brcnv 5859 . . . . 5 (𝑦◡𝐹𝑥 ↔ 𝑥𝐹𝑦)
109mobii 2573 . . . 4 (∃*𝑥 𝑦◡𝐹𝑥 ↔ ∃*𝑥 𝑥𝐹𝑦)
1110albii 1851 . . 3 (∀𝑦∃*𝑥 𝑦◡𝐹𝑥 ↔ ∀𝑦∃*𝑥 𝑥𝐹𝑦)
126, 11bitri 278 . 2 (Fun ◡𝐹 ↔ ∀𝑦∃*𝑥 𝑥𝐹𝑦)
13 funcnvmpt.0 . . . . 5 Ⅎ𝑥𝜑
14 funcnvmpt.3 . . . . . . . . . 10 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
1514funmpt2 6579 . . . . . . . . 9 Fun 𝐹
16 funbrfv2b 6942 . . . . . . . . 9 (Fun 𝐹 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) = 𝑦)))
1715, 16ax-mp 5 . . . . . . . 8 (𝑥𝐹𝑦 ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) = 𝑦))
1814dmmpt 6241 . . . . . . . . . . 11 dom 𝐹 = {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V}
19 funcnvmpt.4 . . . . . . . . . . . . . 14 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
2019elexd 3473 . . . . . . . . . . . . 13 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ V)
2113, 20ralrimia 3261 . . . . . . . . . . . 12 (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ V)
22 funcnvmpt.1 . . . . . . . . . . . . 13 Ⅎ𝑥𝐴
2322rabid2f 3442 . . . . . . . . . . . 12 (𝐴 = {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V} ↔ ∀𝑥 ∈ 𝐴 𝐵 ∈ V)
2421, 23sylibr 237 . . . . . . . . . . 11 (𝜑 → 𝐴 = {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V})
2518, 24eqtr4id 2814 . . . . . . . . . 10 (𝜑 → dom 𝐹 = 𝐴)
2625eleq2d 2846 . . . . . . . . 9 (𝜑 → (𝑥 ∈ dom 𝐹 ↔ 𝑥 ∈ 𝐴))
2726anbi1d 643 . . . . . . . 8 (𝜑 → ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) = 𝑦) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝑦)))
2817, 27bitrid 286 . . . . . . 7 (𝜑 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝑦)))
2928bian1d 591 . . . . . 6 (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = 𝑦)))
30 simpr 490 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
3114fveq1i 6886 . . . . . . . . . . 11 (𝐹‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)
3222fvmpt2f 6994 . . . . . . . . . . 11 ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
3331, 32eqtrid 2807 . . . . . . . . . 10 ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → (𝐹‘𝑥) = 𝐵)
3430, 19, 33syl2anc 596 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵)
3534eqeq2d 2771 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) ↔ 𝑦 = 𝐵))
36 eqcom 2767 . . . . . . . . 9 ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
3726biimpar 483 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ dom 𝐹)
38 funbrfvb 6938 . . . . . . . . . 10 ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) = 𝑦 ↔ 𝑥𝐹𝑦))
3915, 37, 38sylancr 599 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑦 ↔ 𝑥𝐹𝑦))
4036, 39bitr3id 288 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) ↔ 𝑥𝐹𝑦))
4135, 40bitr3d 284 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = 𝐵 ↔ 𝑥𝐹𝑦))
4241pm5.32da 590 . . . . . 6 (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦)))
4329, 42, 283bitr4rd 315 . . . . 5 (𝜑 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)))
4413, 43mobid 2575 . . . 4 (𝜑 → (∃*𝑥 𝑥𝐹𝑦 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)))
45 df-rmo 3365 . . . 4 (∃*𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵))
4644, 45bitr4di 292 . . 3 (𝜑 → (∃*𝑥 𝑥𝐹𝑦 ↔ ∃*𝑥 ∈ 𝐴 𝑦 = 𝐵))
4746albidv 1952 . 2 (𝜑 → (∀𝑦∃*𝑥 𝑥𝐹𝑦 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 = 𝐵))
4812, 47bitrid 286 1 (𝜑 → (Fun ◡𝐹 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 = 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569  Ⅎwnf 1815   ∈ wcel 2144  ∃*wmo 2562  Ⅎwnfc 2907  ∀wral 3076  ∃*wrmo 3364  {crab 3412  Vcvv 3450   class class class wbr 5102   ↦ cmpt 5185  ◡ccnv 5649  dom cdm 5650  Rel wrel 5655  Fun wfun 6532  ‘cfv 6538
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-nul 5259  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-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  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-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546
This theorem is used by:  funcnv5mpt  33303  disjqmap2  39801
  Copyright terms: Public domain W3C validator