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

Theorem fvmptf 7011
Description: Value of a function given by an ordered-pair class abstraction. This version of fvmptg 6987 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 8-Nov-2005.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
fvmptf.1 𝑥𝐴
fvmptf.2 𝑥𝐶
fvmptf.3 (𝑥 = 𝐴𝐵 = 𝐶)
fvmptf.4 𝐹 = (𝑥𝐷𝐵)
Assertion
Ref Expression
fvmptf ((𝐴𝐷𝐶𝑉) → (𝐹𝐴) = 𝐶)
Distinct variable group:   𝑥,𝐷
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥)   𝐹(𝑥)   𝑉(𝑥)

Proof of Theorem fvmptf
StepHypRef Expression
1 fvmptf.1 . . 3 𝑥𝐴
2 fvmptf.2 . . . . 5 𝑥𝐶
32nfel1 2939 . . . 4 𝑥 𝐶 ∈ V
4 fvmptf.4 . . . . . . 7 𝐹 = (𝑥𝐷𝐵)
5 nfmpt1 5209 . . . . . . 7 𝑥(𝑥𝐷𝐵)
64, 5nfcxfr 2921 . . . . . 6 𝑥𝐹
76, 1nffv 6891 . . . . 5 𝑥(𝐹𝐴)
87, 2nfeq 2936 . . . 4 𝑥(𝐹𝐴) = 𝐶
93, 8nfim 1924 . . 3 𝑥(𝐶 ∈ V → (𝐹𝐴) = 𝐶)
10 fvmptf.3 . . . . 5 (𝑥 = 𝐴𝐵 = 𝐶)
1110eleq1d 2846 . . . 4 (𝑥 = 𝐴 → (𝐵 ∈ V ↔ 𝐶 ∈ V))
12 fveq2 6881 . . . . 5 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
1312, 10eqeq12d 2777 . . . 4 (𝑥 = 𝐴 → ((𝐹𝑥) = 𝐵 ↔ (𝐹𝐴) = 𝐶))
1411, 13imbi12d 347 . . 3 (𝑥 = 𝐴 → ((𝐵 ∈ V → (𝐹𝑥) = 𝐵) ↔ (𝐶 ∈ V → (𝐹𝐴) = 𝐶)))
154fvmpt2 7001 . . . 4 ((𝑥𝐷𝐵 ∈ V) → (𝐹𝑥) = 𝐵)
1615ex 417 . . 3 (𝑥𝐷 → (𝐵 ∈ V → (𝐹𝑥) = 𝐵))
171, 9, 14, 16vtoclgaf 3539 . 2 (𝐴𝐷 → (𝐶 ∈ V → (𝐹𝐴) = 𝐶))
18 elex 3474 . 2 (𝐶𝑉𝐶 ∈ V)
1917, 18impel 514 1 ((𝐴𝐷𝐶𝑉) → (𝐹𝐴) = 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1568  wcel 2141  wnfc 2908  Vcvv 3453  cmpt 5191  cfv 6536
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-nul 5268  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fv 6544
This theorem is referenced by:  fvmptnf  7012  elfvmptrab1w  7017  elfvmptrab1  7018  elovmpt3rab1  7670  rdgsucmptf  8414  frsucmpt  8424  fprodntriv  15995  prodss  16000  fprodefsum  16148  dvfsumabs  26161  dvfsumlem1  26164  dvfsumlem4  26167  dvfsum2  26172  dchrisumlem2  27630  dchrisumlem3  27631  rmfsupp2  33523  ptrest  38214  hlhilset  42654  orbitclmpt  45615  fsumsermpt  46243  mulc1cncfg  46253  expcnfg  46255  climsubmpt  46322  climeldmeqmpt  46330  climfveqmpt  46333  fnlimfvre  46336  climfveqmpt3  46344  climeldmeqmpt3  46351  climinf2mpt  46376  climinfmpt  46377  stoweidlem23  46685  stoweidlem34  46696  stoweidlem36  46698  wallispilem5  46731  stirlinglem4  46739  stirlinglem11  46746  stirlinglem12  46747  stirlinglem13  46748  stirlinglem14  46749  sge0lempt  47072  sge0isummpt2  47094  meadjiun  47128  hoimbl2  47327  vonhoire  47334
  Copyright terms: Public domain W3C validator