| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > f1ofveu | 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 5605 | . . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴) | |
| 2 | f1of 5592 | . . . 4 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴) | |
| 3 | 1, 2 | syl 14 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵⟶𝐴) |
| 4 | feu 5527 | . . 3 ⊢ ((◡𝐹:𝐵⟶𝐴 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹) | |
| 5 | 3, 4 | sylan 283 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹) |
| 6 | f1ocnvfvb 5931 | . . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝑥) = 𝐶 ↔ (◡𝐹‘𝐶) = 𝑥)) | |
| 7 | 6 | 3com23 1236 | . . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ (◡𝐹‘𝐶) = 𝑥)) |
| 8 | dff1o4 5600 | . . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵)) | |
| 9 | 8 | simprbi 275 | . . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹 Fn 𝐵) |
| 10 | fnopfvb 5694 | . . . . . . 7 ⊢ ((◡𝐹 Fn 𝐵 ∧ 𝐶 ∈ 𝐵) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) | |
| 11 | 10 | 3adant3 1044 | . . . . . 6 ⊢ ((◡𝐹 Fn 𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 12 | 9, 11 | syl3an1 1307 | . . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((◡𝐹‘𝐶) = 𝑥 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 13 | 7, 12 | bitrd 188 | . . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 14 | 13 | 3expa 1230 | . . 3 ⊢ (((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝐶 ↔ 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 15 | 14 | reubidva 2718 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → (∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶 ↔ ∃!𝑥 ∈ 𝐴 〈𝐶, 𝑥〉 ∈ ◡𝐹)) |
| 16 | 5, 15 | mpbird 167 | 1 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐶 ∈ 𝐵) → ∃!𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ∃!wreu 2513 〈cop 3676 ◡ccnv 4730 Fn wfn 5328 ⟶wf 5329 –1-1-onto→wf1o 5332 ‘cfv 5333 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-reu 2518 df-v 2805 df-sbc 3033 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 |
| This theorem is referenced by: 1arith2 13004 uspgredgiedg 16102 |
| Copyright terms: Public domain | W3C validator |