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 6390 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → Fun {〈𝐴, 𝐵〉}) | |
2 | dmsnopg 6045 | . . 3 ⊢ (𝐵 ∈ 𝑊 → dom {〈𝐴, 𝐵〉} = {𝐴}) | |
3 | 2 | adantl 485 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → dom {〈𝐴, 𝐵〉} = {𝐴}) |
4 | df-fn 6342 | . 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 1542 ∈ wcel 2114 {csn 4516 〈cop 4522 dom cdm 5525 Fun wfun 6333 Fn wfn 6334 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-sep 5167 ax-nul 5174 ax-pr 5296 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ral 3058 df-rex 3059 df-v 3400 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-nul 4212 df-if 4415 df-sn 4517 df-pr 4519 df-op 4523 df-br 5031 df-opab 5093 df-id 5429 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-fun 6341 df-fn 6342 |
This theorem is referenced by: fnsn 6397 fnunop 6451 fvsnun2 6957 fsnunfv 6961 mat1dimscm 21228 m1detdiag 21350 actfunsnf1o 32156 actfunsnrndisj 32157 breprexplema 32182 noextenddif 33516 noextendlt 33517 noextendgt 33518 metakunt19 39756 fnsnbt 39812 |
Copyright terms: Public domain | W3C validator |