Theorem foelrnf 42613

Description: Property of a surjective function. As foelrn 6964 but with less disjoint vars constraints. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypothesis

Ref	Expression
foelrnf.1	⊢ Ⅎ𝑥𝐹

Assertion

Ref	Expression
foelrnf	⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝐶 = (𝐹‘𝑥))

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

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem foelrnf

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		foelrnf.1	. . . 4 ⊢ Ⅎ𝑥𝐹
2	1	dffo3f 42606	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))
3	2	simprbi 496	. 2 ⊢ (𝐹:𝐴–onto→𝐵 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
4		eqeq1 2742	. . . 4 ⊢ (𝑦 = 𝐶 → (𝑦 = (𝐹‘𝑥) ↔ 𝐶 = (𝐹‘𝑥)))
5	4	rexbidv 3225	. . 3 ⊢ (𝑦 = 𝐶 → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ ∃𝑥 ∈ 𝐴 𝐶 = (𝐹‘𝑥)))
6	5	rspccva 3551	. 2 ⊢ ((∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ∧ 𝐶 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝐶 = (𝐹‘𝑥))
7	3, 6	sylan 579	1 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝐶 = (𝐹‘𝑥))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1539   ∈ wcel 2108  Ⅎwnfc 2886  ∀wral 3063  ∃wrex 3064  ⟶wf 6414  –onto→wfo 6416  ‘cfv 6418

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fo 6424  df-fv 6426

This theorem is referenced by:  fompt  42619