| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1ofveu | Structured version Visualization version GIF version | ||
| Description: There is one domain element for each value of a one-to-one onto function. (Contributed by NM, 26-May-2006.) |
| Ref | Expression |
|---|---|
| f1ofveu | ⊢ ((𝐹:𝐴⟶1-1onto𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1ocnv 6867 | . . . 4 ⊢ (𝐹:𝐴⟶1-1onto𝐵 → ◡𝐹:𝐵⟶1-1onto𝐴) | |
| 2 | f1of 6854 | . . . 4 ⊢ (◡𝐹:𝐵⟶1-1onto𝐴 → ◡𝐹:𝐵⟶𝐴) | |
| 3 | 1, 2 | syl 18 | . . 3 ⊢ (𝐹:𝐴⟶1-1onto𝐵 → ◡𝐹:𝐵⟶𝐴) |
| 4 | feu 6788 | . . 3 ⊢ ((◡𝐹:𝐵⟶𝐴 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹) | |
| 5 | 3, 4 | sylan 592 | . 2 ⊢ ((𝐹:𝐴⟶1-1onto𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹) |
| 6 | f1ocnvfvb 7318 | . . . . . 6 ⊢ ((𝐹:𝐴⟶1-1onto𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝑥) = 𝐶 ↔ (◡𝐹‘𝐶) = 𝑥)) | |
| 7 | 6 | 3com23 1144 | . . . . 5 ⊢ ((𝐹:𝐴⟶1-1onto𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ (◡𝐹‘𝐶) = 𝑥)) |
| 8 | dff1o4 6863 | . . . . . . 7 ⊢ (𝐹:𝐴⟶1-1onto𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵)) | |
| 9 | 8 | simprbi 503 | . . . . . 6 ⊢ (𝐹:𝐴⟶1-1onto𝐵 → ◡𝐹 Fn 𝐵) |
| 10 | fnopfvb 6967 | . . . . . . 7 ⊢ ((◡𝐹 Fn 𝐵 ∧ 𝐶 ∈ 𝐵) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) | |
| 11 | 10 | 3adant3 1150 | . . . . . 6 ⊢ ((◡𝐹 Fn 𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 12 | 9, 11 | syl3an1 1181 | . . . . 5 ⊢ ((𝐹:𝐴⟶1-1onto𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 13 | 7, 12 | bitrd 282 | . . . 4 ⊢ ((𝐹:𝐴⟶1-1onto𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 14 | 13 | 3expa 1136 | . . 3 ⊢ (((𝐹:𝐴⟶1-1onto𝐵 ∧ 𝐶 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 15 | 14 | reubidva 3383 | . 2 ⊢ ((𝐹:𝐴⟶1-1onto𝐵 ∧ 𝐶 ∈ 𝐵) → (∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶 ↔ ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 16 | 5, 15 | mpbird 260 | 1 ⊢ ((𝐹:𝐴⟶1-1onto𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∃!wreu 3367 〈cop 4840 ◡ccnv 5657 Fn wfn 6561 ⟶wf 6562 ⟶1-1ontowf1o 6565 ‘cfv 6566 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 |
| This theorem is used by: 1arith2 17150 uspgredgiedg 29813 disjrdx 33283 ply1divalg3 36615 reuf1odnf 48451 reuf1od 48452 uptr2 50668 |
| Copyright terms: Public domain | W3C validator |