| 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 6540 | . 2 ⊢ Fun ◡{〈𝐵, 𝐴〉} | |
| 2 | cnvsng 6179 | . . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → ◡{〈𝐵, 𝐴〉} = {〈𝐴, 𝐵〉}) | |
| 3 | 2 | ancoms 458 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ◡{〈𝐵, 𝐴〉} = {〈𝐴, 𝐵〉}) |
| 4 | 3 | funeqd 6512 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (Fun ◡{〈𝐵, 𝐴〉} ↔ Fun {〈𝐴, 𝐵〉})) |
| 5 | 1, 4 | mpbii 233 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → Fun {〈𝐴, 𝐵〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {csn 4578 〈cop 4584 ◡ccnv 5621 Fun wfun 6484 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-mo 2537 df-clab 2713 df-cleq 2726 df-clel 2809 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4284 df-if 4478 df-sn 4579 df-pr 4581 df-op 4585 df-br 5097 df-opab 5159 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-fun 6492 |
| This theorem is referenced by: fnsng 6542 funsn 6543 funprg 6544 funtpg 6545 fvsng 7124 tfrlem10 8316 snopfsupp 9292 funsnfsupp 9293 strle1 17083 setsfun 17096 setsfun0 17097 noextend 27632 p1evtxdeqlem 29535 trlsegvdeglem3 30246 bnj519 34841 bnj150 34981 |
| Copyright terms: Public domain | W3C validator |