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

Theorem fvmptf 5739
Description: Value of a function given by an ordered-pair class abstraction. This version of fvmptg 5722 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 2814 . . 3 (𝐶𝑉𝐶 ∈ V)
2 fvmptf.1 . . . 4 𝑥𝐴
3 fvmptf.2 . . . . . 6 𝑥𝐶
43nfel1 2385 . . . . 5 𝑥 𝐶 ∈ V
5 fvmptf.4 . . . . . . . 8 𝐹 = (𝑥𝐷𝐵)
6 nfmpt1 4182 . . . . . . . 8 𝑥(𝑥𝐷𝐵)
75, 6nfcxfr 2371 . . . . . . 7 𝑥𝐹
87, 2nffv 5649 . . . . . 6 𝑥(𝐹𝐴)
98, 3nfeq 2382 . . . . 5 𝑥(𝐹𝐴) = 𝐶
104, 9nfim 1620 . . . 4 𝑥(𝐶 ∈ V → (𝐹𝐴) = 𝐶)
11 fvmptf.3 . . . . . 6 (𝑥 = 𝐴𝐵 = 𝐶)
1211eleq1d 2300 . . . . 5 (𝑥 = 𝐴 → (𝐵 ∈ V ↔ 𝐶 ∈ V))
13 fveq2 5639 . . . . . 6 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
1413, 11eqeq12d 2246 . . . . 5 (𝑥 = 𝐴 → ((𝐹𝑥) = 𝐵 ↔ (𝐹𝐴) = 𝐶))
1512, 14imbi12d 234 . . . 4 (𝑥 = 𝐴 → ((𝐵 ∈ V → (𝐹𝑥) = 𝐵) ↔ (𝐶 ∈ V → (𝐹𝐴) = 𝐶)))
165fvmpt2 5730 . . . . 5 ((𝑥𝐷𝐵 ∈ V) → (𝐹𝑥) = 𝐵)
1716ex 115 . . . 4 (𝑥𝐷 → (𝐵 ∈ V → (𝐹𝑥) = 𝐵))
182, 10, 15, 17vtoclgaf 2869 . . 3 (𝐴𝐷 → (𝐶 ∈ V → (𝐹𝐴) = 𝐶))
191, 18syl5 32 . 2 (𝐴𝐷 → (𝐶𝑉 → (𝐹𝐴) = 𝐶))
2019imp 124 1 ((𝐴𝐷𝐶𝑉) → (𝐹𝐴) = 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2202  wnfc 2361  Vcvv 2802  cmpt 4150  cfv 5326
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334
This theorem is referenced by:  fvmptd3  5740  elfvmptrab1  5741  sumrbdclem  11943  fsum3  11953  isumss  11957  prodrbdclem  12137  prodmodclem2a  12142  zproddc  12145  fprodntrivap  12150  prodssdc  12155  pcmpt  12921
  Copyright terms: Public domain W3C validator