| 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 2738 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵)) |
| 5 | 2, 4 | syl 17 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵)) |
| 6 | dfbi2 474 | . . . . . . 7 ⊢ ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵) ↔ ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))) | |
| 7 | simpr 484 | . . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 = (𝐹‘𝑥)) | |
| 8 | ffvelcdm 7026 | . . . . . . . . . . 11 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) | |
| 9 | 8 | adantr 480 | . . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → (𝐹‘𝑥) ∈ 𝐵) |
| 10 | 7, 9 | eqeltrd 2836 | . . . . . . . . 9 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 ∈ 𝐵) |
| 11 | 10 | rexlimdva2 3139 | . . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ 𝐵)) |
| 12 | 11 | biantrurd 532 | . . . . . . 7 ⊢ (𝐹:𝐴⟶𝐵 → ((𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)) ↔ ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))))) |
| 13 | 6, 12 | bitr4id 290 | . . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵) ↔ (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))) |
| 14 | 13 | albidv 1921 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵) ↔ ∀𝑦(𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))) |
| 15 | eqabcb 2876 | . . . . 5 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵 ↔ ∀𝑦(∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵)) | |
| 16 | df-ral 3052 | . . . . 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 1539 = wceq 1541 ∈ wcel 2113 {cab 2714 ∀wral 3051 ∃wrex 3060 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 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 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 7048 foelrn 7052 foco2 7054 fcofo 7234 foov 7532 fsetfocdm 8798 resixpfo 8874 fofinf1o 9232 wdom2d 9485 brwdom3 9487 isf32lem9 10271 hsmexlem2 10337 cnref1o 12898 tpfo 14423 wwlktovfo 14881 1arith 16855 fullestrcsetc 18074 fullsetcestrc 18089 orbsta 19242 symgextfo 19351 symgfixfo 19368 pwssplit1 21011 rngqiprngimfo 21256 znf1o 21506 cygznlem3 21524 scmatfo 22474 m2cpmfo 22700 pm2mpfo 22758 recosf1o 26500 efif1olem4 26510 mpodvdsmulf1o 27160 dvdsmulf1o 27162 cutsfo 27901 addsfo 27979 negsfo 28049 subsfo 28061 wlkswwlksf1o 29952 wwlksnextsurj 29973 clwlkclwwlkfo 30084 clwwlkfo 30125 eucrctshift 30318 frgrncvvdeqlem9 30382 numclwwlk1lem2fo 30433 mndlactfo 33109 mndractfo 33111 subfacp1lem3 35376 cvmfolem 35473 finixpnum 37806 sticksstones3 42402 wessf1ornlem 45429 projf1o 45441 sumnnodd 45876 dvnprodlem1 46190 fourierdlem54 46404 nnfoctbdjlem 46699 isomenndlem 46774 fsetsnfo 47299 cfsetsnfsetfo 47306 sprsymrelfo 47743 prproropf1o 47753 uspgrsprfo 48394 1arymaptfo 48889 2arymaptfo 48900 rrx2xpref1o 48964 slotresfo 49144 basresposfo 49223 oppff1o 49394 diag1f1o 49779 diag2f1o 49782 |
| Copyright terms: Public domain | W3C validator |