Theorem fvelimabd 6913

Description: Deduction form of fvelimab 6912. (Contributed by Stanislas Polu, 9-Mar-2020.)

Hypotheses

Ref	Expression
fvelimabd.1	⊢ (𝜑 → 𝐹 Fn 𝐴)
fvelimabd.2	⊢ (𝜑 → 𝐵 ⊆ 𝐴)

Assertion

Ref	Expression
fvelimabd	⊢ (𝜑 → (𝐶 ∈ (𝐹 “ 𝐵) ↔ ∃𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝐶))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐶   𝑥,𝐹

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)

Proof of Theorem fvelimabd

Step	Hyp	Ref	Expression
1		fvelimabd.1	. 2 ⊢ (𝜑 → 𝐹 Fn 𝐴)
2		fvelimabd.2	. 2 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
3		fvelimab 6912	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝐶 ∈ (𝐹 “ 𝐵) ↔ ∃𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝐶))
4	1, 2, 3	syl2anc 585	1 ⊢ (𝜑 → (𝐶 ∈ (𝐹 “ 𝐵) ↔ ∃𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝐶))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1542   ∈ wcel 2114  ∃wrex 3061   ⊆ wss 3889   “ cima 5634   Fn wfn 6493  ‘cfv 6498

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-fv 6506

This theorem is referenced by:  unima  6915  resf1extb  7885  ghmqusnsglem1  19255  ghmquskerlem1  19258  lmhmima  21042  mdegldg  26031  ig1peu  26140  2ndimaxp  32719  fnpreimac  32743  fsuppcurry1  32797  fsuppcurry2  32798  swrdrn3  33015  esplyfv1  33713  esplyfv  33714  esplyfval3  33716  fnrelpredd  35234  bj-gabima  37247  extoimad  44591  upgrimpths  48385