| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > funsng | Structured version Visualization version GIF version | ||
| Description: A singleton of an ordered pair is a function. Theorem 10.5 of [Quine] p. 65. (Contributed by NM, 28-Jun-2011.) |
| Ref | Expression |
|---|---|
| funsng | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → Fun {〈𝐴, 𝐵〉}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funcnvsn 6548 | . 2 ⊢ Fun ◡{〈𝐵, 𝐴〉} | |
| 2 | cnvsng 6187 | . . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → ◡{〈𝐵, 𝐴〉} = {〈𝐴, 𝐵〉}) | |
| 3 | 2 | ancoms 458 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ◡{〈𝐵, 𝐴〉} = {〈𝐴, 𝐵〉}) |
| 4 | 3 | funeqd 6520 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (Fun ◡{〈𝐵, 𝐴〉} ↔ Fun {〈𝐴, 𝐵〉})) |
| 5 | 1, 4 | mpbii 233 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → Fun {〈𝐴, 𝐵〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {csn 4567 〈cop 4573 ◡ccnv 5630 Fun wfun 6492 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 ax-sep 5231 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-mo 2539 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-br 5086 df-opab 5148 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-fun 6500 |
| This theorem is referenced by: fnsng 6550 funsn 6551 funprg 6552 funtpg 6553 fvsng 7135 tfrlem10 8326 snopfsupp 9304 funsnfsupp 9305 strle1 17128 setsfun 17141 setsfun0 17142 noextend 27630 p1evtxdeqlem 29581 trlsegvdeglem3 30292 bnj519 34879 bnj150 35018 |
| Copyright terms: Public domain | W3C validator |