![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fnsng | Structured version Visualization version GIF version |
Description: Functionality and domain of the singleton of an ordered pair. (Contributed by Mario Carneiro, 30-Apr-2015.) |
Ref | Expression |
---|---|
fnsng | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {〈𝐴, 𝐵〉} Fn {𝐴}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funsng 6375 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → Fun {〈𝐴, 𝐵〉}) | |
2 | dmsnopg 6037 | . . 3 ⊢ (𝐵 ∈ 𝑊 → dom {〈𝐴, 𝐵〉} = {𝐴}) | |
3 | 2 | adantl 485 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → dom {〈𝐴, 𝐵〉} = {𝐴}) |
4 | df-fn 6327 | . 2 ⊢ ({〈𝐴, 𝐵〉} Fn {𝐴} ↔ (Fun {〈𝐴, 𝐵〉} ∧ dom {〈𝐴, 𝐵〉} = {𝐴})) | |
5 | 1, 3, 4 | sylanbrc 586 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {〈𝐴, 𝐵〉} Fn {𝐴}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 {csn 4525 〈cop 4531 dom cdm 5519 Fun wfun 6318 Fn wfn 6319 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-fun 6326 df-fn 6327 |
This theorem is referenced by: fnsn 6382 fnunsn 6436 fvsnun2 6922 fsnunfv 6926 mat1dimscm 21080 m1detdiag 21202 actfunsnf1o 31985 actfunsnrndisj 31986 breprexplema 32011 noextenddif 33288 noextendlt 33289 noextendgt 33290 metakunt19 39368 fnsnbt 39414 |
Copyright terms: Public domain | W3C validator |