| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > foelrn | GIF version | ||
| Description: Property of a surjective function. (Contributed by Jeff Madsen, 4-Jan-2011.) (Proof shortened by BJ, 6-Jul-2022.) |
| Ref | Expression |
|---|---|
| foelrn | ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝐶 = (𝐹‘𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | foima2 5891 | . 2 ⊢ (𝐹:𝐴–onto→𝐵 → (𝐶 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝐶 = (𝐹‘𝑥))) | |
| 2 | 1 | biimpa 296 | 1 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝐶 = (𝐹‘𝑥)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ∃wrex 2511 –onto→wfo 5324 ‘cfv 5326 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-v 2804 df-sbc 3032 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fo 5332 df-fv 5334 |
| This theorem is referenced by: foco2 5893 ctmlemr 7306 ctm 7307 ctssdclemn0 7308 ctssdccl 7309 ctssdc 7311 enumctlemm 7312 fodju0 7345 exmidfodomrlemr 7412 exmidfodomrlemrALT 7413 ennnfonelemrn 13039 ctinf 13050 ctiunctlemfo 13059 znidom 14670 znrrg 14673 subctctexmid 16601 pw1nct 16604 |
| Copyright terms: Public domain | W3C validator |