ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fvmptf GIF version

Theorem fvmptf 5798
Description: Value of a function given by an ordered-pair class abstraction. This version of fvmptg 5781 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 elex 2833 . . 3 (𝐶𝑉𝐶 ∈ V)
2 fvmptf.1 . . . 4 𝑥𝐴
3 fvmptf.2 . . . . . 6 𝑥𝐶
43nfel1 2403 . . . . 5 𝑥 𝐶 ∈ V
5 fvmptf.4 . . . . . . . 8 𝐹 = (𝑥𝐷𝐵)
6 nfmpt1 4224 . . . . . . . 8 𝑥(𝑥𝐷𝐵)
75, 6nfcxfr 2389 . . . . . . 7 𝑥𝐹
87, 2nffv 5705 . . . . . 6 𝑥(𝐹𝐴)
98, 3nfeq 2400 . . . . 5 𝑥(𝐹𝐴) = 𝐶
104, 9nfim 1625 . . . 4 𝑥(𝐶 ∈ V → (𝐹𝐴) = 𝐶)
11 fvmptf.3 . . . . . 6 (𝑥 = 𝐴𝐵 = 𝐶)
1211eleq1d 2307 . . . . 5 (𝑥 = 𝐴 → (𝐵 ∈ V ↔ 𝐶 ∈ V))
13 fveq2 5695 . . . . . 6 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
1413, 11eqeq12d 2253 . . . . 5 (𝑥 = 𝐴 → ((𝐹𝑥) = 𝐵 ↔ (𝐹𝐴) = 𝐶))
1512, 14imbi12d 234 . . . 4 (𝑥 = 𝐴 → ((𝐵 ∈ V → (𝐹𝑥) = 𝐵) ↔ (𝐶 ∈ V → (𝐹𝐴) = 𝐶)))
165fvmpt2 5789 . . . . 5 ((𝑥𝐷𝐵 ∈ V) → (𝐹𝑥) = 𝐵)
1716ex 115 . . . 4 (𝑥𝐷 → (𝐵 ∈ V → (𝐹𝑥) = 𝐵))
182, 10, 15, 17vtoclgaf 2888 . . 3 (𝐴𝐷 → (𝐶 ∈ V → (𝐹𝐴) = 𝐶))
191, 18syl5 32 . 2 (𝐴𝐷 → (𝐶𝑉 → (𝐹𝐴) = 𝐶))
2019imp 124 1 ((𝐴𝐷𝐶𝑉) → (𝐹𝐴) = 𝐶)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104   = wceq 1402  wcel 2209  wnfc 2379  Vcvv 2821  cmpt 4192  cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385
This theorem is used by:  fvmptd3  5799  elfvmptrab1  5801  sumrbdclem  12146  fsum3  12156  isumss  12160  prodrbdclem  12340  prodmodclem2a  12345  zproddc  12348  fprodntrivap  12353  prodssdc  12358  pcmpt  13124  gsummptfidmadd  14163
  Copyright terms: Public domain W3C validator