| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dffo3 | Structured version Visualization version GIF version | ||
| Description: An onto mapping expressed in terms of function values. (Contributed by NM, 29-Oct-2006.) |
| Ref | Expression |
|---|---|
| dffo3 | ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dffo2 6750 | . 2 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ran 𝐹 = 𝐵)) | |
| 2 | ffn 6662 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 3 | fnrnfv 6893 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}) | |
| 4 | 3 | eqeq1d 2739 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵)) |
| 5 | 2, 4 | syl 17 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵)) |
| 6 | dfbi2 474 | . . . . . . 7 ⊢ ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵) ↔ ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))) | |
| 7 | simpr 484 | . . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 = (𝐹‘𝑥)) | |
| 8 | ffvelcdm 7027 | . . . . . . . . . . 11 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) | |
| 9 | 8 | adantr 480 | . . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → (𝐹‘𝑥) ∈ 𝐵) |
| 10 | 7, 9 | eqeltrd 2837 | . . . . . . . . 9 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 ∈ 𝐵) |
| 11 | 10 | rexlimdva2 3141 | . . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ 𝐵)) |
| 12 | 11 | biantrurd 532 | . . . . . . 7 ⊢ (𝐹:𝐴⟶𝐵 → ((𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)) ↔ ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))))) |
| 13 | 6, 12 | bitr4id 290 | . . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵) ↔ (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))) |
| 14 | 13 | albidv 1922 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵) ↔ ∀𝑦(𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))) |
| 15 | eqabcb 2877 | . . . . 5 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵 ↔ ∀𝑦(∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵)) | |
| 16 | df-ral 3053 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ ∀𝑦(𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) | |
| 17 | 14, 15, 16 | 3bitr4g 314 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) |
| 18 | 5, 17 | bitrd 279 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → (ran 𝐹 = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) |
| 19 | 18 | pm5.32i 574 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ran 𝐹 = 𝐵) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) |
| 20 | 1, 19 | bitri 275 | 1 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1540 = wceq 1542 ∈ wcel 2114 {cab 2715 ∀wral 3052 ∃wrex 3062 ran crn 5625 Fn wfn 6487 ⟶wf 6488 –onto→wfo 6490 ‘cfv 6492 |
| 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-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pr 5370 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fo 6498 df-fv 6500 |
| This theorem is referenced by: dffo4 7049 foelrn 7053 foco2 7055 fcofo 7236 foov 7534 fsetfocdm 8801 resixpfo 8877 fofinf1o 9235 wdom2d 9488 brwdom3 9490 isf32lem9 10274 hsmexlem2 10340 cnref1o 12926 tpfo 14453 wwlktovfo 14911 1arith 16889 fullestrcsetc 18108 fullsetcestrc 18123 orbsta 19279 symgextfo 19388 symgfixfo 19405 pwssplit1 21046 rngqiprngimfo 21291 znf1o 21541 cygznlem3 21559 scmatfo 22505 m2cpmfo 22731 pm2mpfo 22789 recosf1o 26512 efif1olem4 26522 mpodvdsmulf1o 27171 dvdsmulf1o 27173 cutsfo 27911 addsfo 27989 negsfo 28059 subsfo 28071 wlkswwlksf1o 29962 wwlksnextsurj 29983 clwlkclwwlkfo 30094 clwwlkfo 30135 eucrctshift 30328 frgrncvvdeqlem9 30392 numclwwlk1lem2fo 30443 mndlactfo 33102 mndractfo 33104 subfacp1lem3 35380 cvmfolem 35477 finixpnum 37940 sticksstones3 42601 wessf1ornlem 45633 projf1o 45644 sumnnodd 46078 dvnprodlem1 46392 fourierdlem54 46606 nnfoctbdjlem 46901 isomenndlem 46976 fsetsnfo 47513 cfsetsnfsetfo 47520 sprsymrelfo 47969 prproropf1o 47979 uspgrsprfo 48636 1arymaptfo 49131 2arymaptfo 49142 rrx2xpref1o 49206 slotresfo 49386 basresposfo 49465 oppff1o 49636 diag1f1o 50021 diag2f1o 50024 |
| Copyright terms: Public domain | W3C validator |