| 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 6793 | . 2 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ran 𝐹 = 𝐵)) | |
| 2 | ffn 6702 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 3 | fnrnfv 6937 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}) | |
| 4 | 3 | eqeq1d 2762 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵)) |
| 5 | 2, 4 | syl 18 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵)) |
| 6 | dfbi2 480 | . . . . . . 7 ⊢ ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵) ↔ ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))) | |
| 7 | simpr 490 | . . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 = (𝐹‘𝑥)) | |
| 8 | ffvelcdm 7074 | . . . . . . . . . . 11 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) | |
| 9 | 8 | adantr 486 | . . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → (𝐹‘𝑥) ∈ 𝐵) |
| 10 | 7, 9 | eqeltrd 2860 | . . . . . . . . 9 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 ∈ 𝐵) |
| 11 | 10 | rexlimdva2 3165 | . . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ 𝐵)) |
| 12 | 11 | biantrurd 542 | . . . . . . 7 ⊢ (𝐹:𝐴⟶𝐵 → ((𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)) ↔ ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → 𝑦 ∈ 𝐵) ∧ (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))))) |
| 13 | 6, 12 | bitr4id 293 | . . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → ((∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵) ↔ (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))) |
| 14 | 13 | albidv 1953 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵) ↔ ∀𝑦(𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))) |
| 15 | eqabcb 2900 | . . . . 5 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵 ↔ ∀𝑦(∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ 𝑦 ∈ 𝐵)) | |
| 16 | df-ral 3077 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) ↔ ∀𝑦(𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) | |
| 17 | 14, 15, 16 | 3bitr4g 317 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)} = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) |
| 18 | 5, 17 | bitrd 282 | . . 3 ⊢ (𝐹:𝐴⟶𝐵 → (ran 𝐹 = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) |
| 19 | 18 | pm5.32i 585 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ran 𝐹 = 𝐵) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) |
| 20 | 1, 19 | bitri 278 | 1 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 = wceq 1570 ∈ wcel 2145 {cab 2738 ∀wral 3076 ∃wrex 3086 ran crn 5656 Fn wfn 6528 ⟶wf 6529 –onto→wfo 6531 ‘cfv 6533 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fo 6539 df-fv 6541 |
| This theorem is used by: dffo4 7096 foelrn 7100 foco2 7102 fcofo 7289 foov 7588 fsetfocdm 8862 resixpfo 8943 fofinf1o 9299 wdom2d 9552 brwdom3 9554 isf32lem9 10363 hsmexlem2 10429 cnref1o 13035 tpfo 14565 wwlktovfo 15031 1arith 17019 fullestrcsetc 18239 fullsetcestrc 18254 orbsta 19440 symgextfo 19549 symgfixfo 19566 pwssplit1 21243 rngqiprngimfo 21504 znf1o 21764 cygznlem3 21782 scmatfo 22752 m2cpmfo 22981 pm2mpfo 23039 recosf1o 26772 efif1olem4 26782 mpodvdsmulf1o 27430 dvdsmulf1o 27432 cutsfo 28170 addsfo 28248 negsfo 28318 subsfo 28330 wlkswwlksf1o 30347 wwlksnextsurj 30368 clwlkclwwlkfo 30479 clwwlkfo 30520 eucrctshift 30723 frgrncvvdeqlem9 30787 numclwwlk1lem2fo 30838 mndlactfo 33467 mndractfo 33469 rankfo 35619 subfacp1lem3 35761 cvmfolem 35858 finixpnum 38359 sticksstones3 43014 wessf1ornlem 46017 projf1o 46028 sumnnodd 46460 dvnprodlem1 46774 fourierdlem54 46988 nnfoctbdjlem 47283 isomenndlem 47358 fsetsnfo 47941 cfsetsnfsetfo 47948 sprsymrelfo 48397 prproropf1o 48407 uspgrsprfo 49064 1arymaptfo 49573 2arymaptfo 49584 rrx2xpref1o 49648 slotresfo 49825 basresposfo 49904 oppff1o 50075 diag1f1o 50460 diag2f1o 50463 |
| Copyright terms: Public domain | W3C validator |