Theorem foelrn 5570

Description: Property of a surjective function. (Contributed by Jeff Madsen, 4-Jan-2011.) (Proof shortened by BJ, 6-Jul-2022.)

Assertion

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

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

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem foelrn

Step	Hyp	Ref	Expression
1		foima2 5569	. 2 ⊢ (𝐹:𝐴–onto→𝐵 → (𝐶 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝐶 = (𝐹‘𝑥)))
2	1	biimpa 291	1 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝐶 = (𝐹‘𝑥))

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1296   ∈ wcel 1445  ∃wrex 2371  –onto→wfo 5047  ‘cfv 5049

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 668  ax-5 1388  ax-7 1389  ax-gen 1390  ax-ie1 1434  ax-ie2 1435  ax-8 1447  ax-10 1448  ax-11 1449  ax-i12 1450  ax-bndl 1451  ax-4 1452  ax-14 1457  ax-17 1471  ax-i9 1475  ax-ial 1479  ax-i5r 1480  ax-ext 2077  ax-sep 3978  ax-pow 4030  ax-pr 4060

This theorem depends on definitions:  df-bi 116  df-3an 929  df-tru 1299  df-nf 1402  df-sb 1700  df-eu 1958  df-mo 1959  df-clab 2082  df-cleq 2088  df-clel 2091  df-nfc 2224  df-ral 2375  df-rex 2376  df-v 2635  df-sbc 2855  df-un 3017  df-in 3019  df-ss 3026  df-pw 3451  df-sn 3472  df-pr 3473  df-op 3475  df-uni 3676  df-br 3868  df-opab 3922  df-id 4144  df-xp 4473  df-rel 4474  df-cnv 4475  df-co 4476  df-dm 4477  df-rn 4478  df-res 4479  df-ima 4480  df-iota 5014  df-fun 5051  df-fn 5052  df-f 5053  df-fo 5055  df-fv 5057

This theorem is referenced by:  foco2  5571  ctmlemr  6870  ctm  6871  enumctlemm  6872  fodju0  6890  exmidfodomrlemr  6925  exmidfodomrlemrALT  6926