| 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-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1ocnv 6779 | . . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴) | |
| 2 | f1of 6767 | . . . 4 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴) | |
| 3 | 1, 2 | syl 17 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵⟶𝐴) |
| 4 | feu 6703 | . . 3 ⊢ ((◡𝐹:𝐵⟶𝐴 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹) | |
| 5 | 3, 4 | sylan 586 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹) |
| 6 | f1ocnvfvb 7223 | . . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝑥) = 𝐶 ↔ (◡𝐹‘𝐶) = 𝑥)) | |
| 7 | 6 | 3com23 1132 | . . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ (◡𝐹‘𝐶) = 𝑥)) |
| 8 | dff1o4 6775 | . . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵)) | |
| 9 | 8 | simprbi 498 | . . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹 Fn 𝐵) |
| 10 | fnopfvb 6878 | . . . . . . 7 ⊢ ((◡𝐹 Fn 𝐵 ∧ 𝐶 ∈ 𝐵) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) | |
| 11 | 10 | 3adant3 1138 | . . . . . 6 ⊢ ((◡𝐹 Fn 𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 12 | 9, 11 | syl3an1 1169 | . . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 13 | 7, 12 | bitrd 280 | . . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 14 | 13 | 3expa 1124 | . . 3 ⊢ (((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 15 | 14 | reubidva 3358 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → (∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶 ↔ ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 16 | 5, 15 | mpbird 258 | 1 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ∃!wreu 3342 〈cop 4561 ◡ccnv 5617 Fn wfn 6480 ⟶wf 6481 –1-1-onto→wf1o 6484 ‘cfv 6485 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 |
| This theorem is referenced by: 1arith2 16890 uspgredgiedg 29262 disjrdx 32680 ply1divalg3 35870 reuf1odnf 47570 reuf1od 47571 uptr2 49711 |
| Copyright terms: Public domain | W3C validator |