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

Theorem ffnfvf 7065
Description: A function maps to a class to which all values belong. This version of ffnfv 7064 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 28-Sep-2006.)
Hypotheses
Ref Expression
ffnfvf.1 𝑥𝐴
ffnfvf.2 𝑥𝐵
ffnfvf.3 𝑥𝐹
Assertion
Ref Expression
ffnfvf (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝐵))

Proof of Theorem ffnfvf
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 ffnfv 7064 . 2 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑧𝐴 (𝐹𝑧) ∈ 𝐵))
2 nfcv 2898 . . . 4 𝑧𝐴
3 ffnfvf.1 . . . 4 𝑥𝐴
4 ffnfvf.3 . . . . . 6 𝑥𝐹
5 nfcv 2898 . . . . . 6 𝑥𝑧
64, 5nffv 6844 . . . . 5 𝑥(𝐹𝑧)
7 ffnfvf.2 . . . . 5 𝑥𝐵
86, 7nfel 2913 . . . 4 𝑥(𝐹𝑧) ∈ 𝐵
9 nfv 1915 . . . 4 𝑧(𝐹𝑥) ∈ 𝐵
10 fveq2 6834 . . . . 5 (𝑧 = 𝑥 → (𝐹𝑧) = (𝐹𝑥))
1110eleq1d 2821 . . . 4 (𝑧 = 𝑥 → ((𝐹𝑧) ∈ 𝐵 ↔ (𝐹𝑥) ∈ 𝐵))
122, 3, 8, 9, 11cbvralfw 3276 . . 3 (∀𝑧𝐴 (𝐹𝑧) ∈ 𝐵 ↔ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝐵)
1312anbi2i 623 . 2 ((𝐹 Fn 𝐴 ∧ ∀𝑧𝐴 (𝐹𝑧) ∈ 𝐵) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝐵))
141, 13bitri 275 1 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐴 (𝐹𝑥) ∈ 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wcel 2113  wnfc 2883  wral 3051   Fn wfn 6487  wf 6488  cfv 6492
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500
This theorem is referenced by:  ixpf  8858  fconst7v  32698  fconst7  45518
  Copyright terms: Public domain W3C validator