| 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 6550 | . 2 ⊢ Fun ◡{〈𝐵, 𝐴〉} | |
| 2 | cnvsng 6189 | . . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → ◡{〈𝐵, 𝐴〉} = {〈𝐴, 𝐵〉}) | |
| 3 | 2 | ancoms 458 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ◡{〈𝐵, 𝐴〉} = {〈𝐴, 𝐵〉}) |
| 4 | 3 | funeqd 6522 | . 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 4582 〈cop 4588 ◡ccnv 5631 Fun wfun 6494 |
| 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 5243 ax-pr 5379 |
| 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 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-fun 6502 |
| This theorem is referenced by: fnsng 6552 funsn 6553 funprg 6554 funtpg 6555 fvsng 7136 tfrlem10 8328 snopfsupp 9306 funsnfsupp 9307 strle1 17097 setsfun 17110 setsfun0 17111 noextend 27646 p1evtxdeqlem 29598 trlsegvdeglem3 30309 bnj519 34913 bnj150 35052 |
| Copyright terms: Public domain | W3C validator |