| 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 6837 | . . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴) | |
| 2 | f1of 6824 | . . . 4 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴) | |
| 3 | 1, 2 | syl 18 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵⟶𝐴) |
| 4 | feu 6758 | . . 3 ⊢ ((◡𝐹:𝐵⟶𝐴 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹) | |
| 5 | 3, 4 | sylan 592 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹) |
| 6 | f1ocnvfvb 7283 | . . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝑥) = 𝐶 ↔ (◡𝐹‘𝐶) = 𝑥)) | |
| 7 | 6 | 3com23 1144 | . . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ (◡𝐹‘𝐶) = 𝑥)) |
| 8 | dff1o4 6833 | . . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵)) | |
| 9 | 8 | simprbi 503 | . . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹 Fn 𝐵) |
| 10 | fnopfvb 6936 | . . . . . . 7 ⊢ ((◡𝐹 Fn 𝐵 ∧ 𝐶 ∈ 𝐵) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) | |
| 11 | 10 | 3adant3 1150 | . . . . . 6 ⊢ ((◡𝐹 Fn 𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 12 | 9, 11 | syl3an1 1181 | . . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 13 | 7, 12 | bitrd 282 | . . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 14 | 13 | 3expa 1136 | . . 3 ⊢ (((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 15 | 14 | reubidva 3385 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → (∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶 ↔ ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 16 | 5, 15 | mpbird 260 | 1 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∃!wreu 3369 〈cop 4597 ◡ccnv 5662 Fn wfn 6535 ⟶wf 6536 –1-1-onto→wf1o 6539 ‘cfv 6540 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 |
| This theorem is used by: 1arith2 17006 uspgredgiedg 29559 disjrdx 32983 ply1divalg3 36147 reuf1odnf 47877 reuf1od 47878 uptr2 50032 |
| Copyright terms: Public domain | W3C validator |