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

Theorem fmpt2d 7117
Description: Domain and codomain of the mapping operation; deduction form. (Contributed by NM, 27-Dec-2014.)
Hypotheses
Ref Expression
fmpt2d.2 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
fmpt2d.1 (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
fmpt2d.3 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ 𝐶)
Assertion
Ref Expression
fmpt2d (𝜑 → 𝐹:𝐴⟶𝐶)
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴   𝑦,𝐶   𝑦,𝐹   𝜑,𝑥   𝜑,𝑦
Allowed substitution hints:   𝐵(𝑥, 𝑦)   𝐶(𝑥)   𝐹(𝑥)   𝑉(𝑥, 𝑦)

Proof of Theorem fmpt2d
StepHypRef Expression
1 fmpt2d.2 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
21ralrimiva 3155 . . . 4 (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉)
3 eqid 2761 . . . . 5 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
43fnmpt 6671 . . . 4 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
52, 4syl 18 . . 3 (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
6 fmpt2d.1 . . . 4 (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
76fneq1d 6624 . . 3 (𝜑 → (𝐹 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴))
85, 7mpbird 260 . 2 (𝜑 → 𝐹 Fn 𝐴)
9 fmpt2d.3 . . 3 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ 𝐶)
109ralrimiva 3155 . 2 (𝜑 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐶)
11 ffnfv 7111 . 2 (𝐹:𝐴⟶𝐶 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐶))
128, 10, 11sylanbrc 595 1 (𝜑 → 𝐹:𝐴⟶𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ↦ cmpt 5186   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539
This theorem is used by:  cantnff  9659  limsupgre  15628  idaf  18218  curfcl  18386  ghmqusnsg  19476  ghmquskerlem3  19480  ghmqusker  19481  mat2pmatf  23026  m2cpmf  23040  pm2mpf  23096  clsf  23346  kgenf  23840  lgamf  27351  vmaf  27428  lgsdchr  27664  mirf  29114  suppovss  33256  selvply1rhmlema  34132  extvfvcl  34150  extvfvalf  34151  omsf  34911  erdszelem6  35930  cdleme50f  41567  dochfN  42381  binomcxplemdvsum  45298
  Copyright terms: Public domain W3C validator