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

Theorem fvmptf 5610
Description: Value of a function given by an ordered-pair class abstraction. This version of fvmptg 5594 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 2750 . . 3 (𝐶𝑉𝐶 ∈ V)
2 fvmptf.1 . . . 4 𝑥𝐴
3 fvmptf.2 . . . . . 6 𝑥𝐶
43nfel1 2330 . . . . 5 𝑥 𝐶 ∈ V
5 fvmptf.4 . . . . . . . 8 𝐹 = (𝑥𝐷𝐵)
6 nfmpt1 4098 . . . . . . . 8 𝑥(𝑥𝐷𝐵)
75, 6nfcxfr 2316 . . . . . . 7 𝑥𝐹
87, 2nffv 5527 . . . . . 6 𝑥(𝐹𝐴)
98, 3nfeq 2327 . . . . 5 𝑥(𝐹𝐴) = 𝐶
104, 9nfim 1572 . . . 4 𝑥(𝐶 ∈ V → (𝐹𝐴) = 𝐶)
11 fvmptf.3 . . . . . 6 (𝑥 = 𝐴𝐵 = 𝐶)
1211eleq1d 2246 . . . . 5 (𝑥 = 𝐴 → (𝐵 ∈ V ↔ 𝐶 ∈ V))
13 fveq2 5517 . . . . . 6 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
1413, 11eqeq12d 2192 . . . . 5 (𝑥 = 𝐴 → ((𝐹𝑥) = 𝐵 ↔ (𝐹𝐴) = 𝐶))
1512, 14imbi12d 234 . . . 4 (𝑥 = 𝐴 → ((𝐵 ∈ V → (𝐹𝑥) = 𝐵) ↔ (𝐶 ∈ V → (𝐹𝐴) = 𝐶)))
165fvmpt2 5601 . . . . 5 ((𝑥𝐷𝐵 ∈ V) → (𝐹𝑥) = 𝐵)
1716ex 115 . . . 4 (𝑥𝐷 → (𝐵 ∈ V → (𝐹𝑥) = 𝐵))
182, 10, 15, 17vtoclgaf 2804 . . 3 (𝐴𝐷 → (𝐶 ∈ V → (𝐹𝐴) = 𝐶))
191, 18syl5 32 . 2 (𝐴𝐷 → (𝐶𝑉 → (𝐹𝐴) = 𝐶))
2019imp 124 1 ((𝐴𝐷𝐶𝑉) → (𝐹𝐴) = 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1353  wcel 2148  wnfc 2306  Vcvv 2739  cmpt 4066  cfv 5218
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-csb 3060  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fv 5226
This theorem is referenced by:  fvmptd3  5611  elfvmptrab1  5612  sumrbdclem  11387  fsum3  11397  isumss  11401  prodrbdclem  11581  prodmodclem2a  11586  zproddc  11589  fprodntrivap  11594  prodssdc  11599  pcmpt  12343
  Copyright terms: Public domain W3C validator