| 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 6543 | . 2 ⊢ Fun ◡{〈𝐵, 𝐴〉} | |
| 2 | cnvsng 6182 | . . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → ◡{〈𝐵, 𝐴〉} = {〈𝐴, 𝐵〉}) | |
| 3 | 2 | ancoms 458 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ◡{〈𝐵, 𝐴〉} = {〈𝐴, 𝐵〉}) |
| 4 | 3 | funeqd 6515 | . 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 4568 〈cop 4574 ◡ccnv 5624 Fun wfun 6487 |
| 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 2709 ax-sep 5232 ax-pr 5371 |
| 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 2540 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-br 5087 df-opab 5149 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-fun 6495 |
| This theorem is referenced by: fnsng 6545 funsn 6546 funprg 6547 funtpg 6548 fvsng 7129 tfrlem10 8320 snopfsupp 9298 funsnfsupp 9299 strle1 17122 setsfun 17135 setsfun0 17136 noextend 27647 p1evtxdeqlem 29599 trlsegvdeglem3 30310 bnj519 34898 bnj150 35037 |
| Copyright terms: Public domain | W3C validator |