| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > f1osng | GIF version | ||
| Description: A singleton of an ordered pair is one-to-one onto function. (Contributed by Mario Carneiro, 12-Jan-2013.) |
| Ref | Expression |
|---|---|
| f1osng | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {〈𝐴, 𝐵〉}:{𝐴}–1-1-onto→{𝐵}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sneq 3720 | . . . 4 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴}) | |
| 2 | f1oeq2 5628 | . . . 4 ⊢ ({𝑎} = {𝐴} → ({〈𝑎, 𝑏〉}:{𝑎}–1-1-onto→{𝑏} ↔ {〈𝑎, 𝑏〉}:{𝐴}–1-1-onto→{𝑏})) | |
| 3 | 1, 2 | syl 14 | . . 3 ⊢ (𝑎 = 𝐴 → ({〈𝑎, 𝑏〉}:{𝑎}–1-1-onto→{𝑏} ↔ {〈𝑎, 𝑏〉}:{𝐴}–1-1-onto→{𝑏})) |
| 4 | opeq1 3904 | . . . . 5 ⊢ (𝑎 = 𝐴 → 〈𝑎, 𝑏〉 = 〈𝐴, 𝑏〉) | |
| 5 | 4 | sneqd 3722 | . . . 4 ⊢ (𝑎 = 𝐴 → {〈𝑎, 𝑏〉} = {〈𝐴, 𝑏〉}) |
| 6 | f1oeq1 5627 | . . . 4 ⊢ ({〈𝑎, 𝑏〉} = {〈𝐴, 𝑏〉} → ({〈𝑎, 𝑏〉}:{𝐴}–1-1-onto→{𝑏} ↔ {〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝑏})) | |
| 7 | 5, 6 | syl 14 | . . 3 ⊢ (𝑎 = 𝐴 → ({〈𝑎, 𝑏〉}:{𝐴}–1-1-onto→{𝑏} ↔ {〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝑏})) |
| 8 | 3, 7 | bitrd 188 | . 2 ⊢ (𝑎 = 𝐴 → ({〈𝑎, 𝑏〉}:{𝑎}–1-1-onto→{𝑏} ↔ {〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝑏})) |
| 9 | sneq 3720 | . . . 4 ⊢ (𝑏 = 𝐵 → {𝑏} = {𝐵}) | |
| 10 | f1oeq3 5629 | . . . 4 ⊢ ({𝑏} = {𝐵} → ({〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝑏} ↔ {〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝐵})) | |
| 11 | 9, 10 | syl 14 | . . 3 ⊢ (𝑏 = 𝐵 → ({〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝑏} ↔ {〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝐵})) |
| 12 | opeq2 3905 | . . . . 5 ⊢ (𝑏 = 𝐵 → 〈𝐴, 𝑏〉 = 〈𝐴, 𝐵〉) | |
| 13 | 12 | sneqd 3722 | . . . 4 ⊢ (𝑏 = 𝐵 → {〈𝐴, 𝑏〉} = {〈𝐴, 𝐵〉}) |
| 14 | f1oeq1 5627 | . . . 4 ⊢ ({〈𝐴, 𝑏〉} = {〈𝐴, 𝐵〉} → ({〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝐵} ↔ {〈𝐴, 𝐵〉}:{𝐴}–1-1-onto→{𝐵})) | |
| 15 | 13, 14 | syl 14 | . . 3 ⊢ (𝑏 = 𝐵 → ({〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝐵} ↔ {〈𝐴, 𝐵〉}:{𝐴}–1-1-onto→{𝐵})) |
| 16 | 11, 15 | bitrd 188 | . 2 ⊢ (𝑏 = 𝐵 → ({〈𝐴, 𝑏〉}:{𝐴}–1-1-onto→{𝑏} ↔ {〈𝐴, 𝐵〉}:{𝐴}–1-1-onto→{𝐵})) |
| 17 | vex 2824 | . . 3 ⊢ 𝑎 ∈ V | |
| 18 | vex 2824 | . . 3 ⊢ 𝑏 ∈ V | |
| 19 | 17, 18 | f1osn 5681 | . 2 ⊢ {〈𝑎, 𝑏〉}:{𝑎}–1-1-onto→{𝑏} |
| 20 | 8, 16, 19 | vtocl2g 2887 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {〈𝐴, 𝐵〉}:{𝐴}–1-1-onto→{𝐵}) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 {csn 3709 〈cop 3712 –1-1-onto→wf1o 5376 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-br 4131 df-opab 4193 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 |
| This theorem is used by: f1sng 5683 f1oprg 5685 fsnunf 5915 suppsnopdc 6490 mapsnd 6970 dif1en 7183 1fv 10548 zfz1isolem1 11294 sumsnf 12178 prodsnf 12361 ennnfonelemhf1o 13306 gsumsncmn 14158 gsump1 14159 |
| Copyright terms: Public domain | W3C validator |