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 6405 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → Fun {〈𝐴, 𝐵〉}) | |
2 | dmsnopg 6070 | . . 3 ⊢ (𝐵 ∈ 𝑊 → dom {〈𝐴, 𝐵〉} = {𝐴}) | |
3 | 2 | adantl 484 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → dom {〈𝐴, 𝐵〉} = {𝐴}) |
4 | df-fn 6358 | . 2 ⊢ ({〈𝐴, 𝐵〉} Fn {𝐴} ↔ (Fun {〈𝐴, 𝐵〉} ∧ dom {〈𝐴, 𝐵〉} = {𝐴})) | |
5 | 1, 3, 4 | sylanbrc 585 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {〈𝐴, 𝐵〉} Fn {𝐴}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 {csn 4567 〈cop 4573 dom cdm 5555 Fun wfun 6349 Fn wfn 6350 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-fun 6357 df-fn 6358 |
This theorem is referenced by: fnsn 6412 fnunsn 6464 fvsnun2 6945 fsnunfv 6949 mat1dimscm 21084 m1detdiag 21206 actfunsnf1o 31875 actfunsnrndisj 31876 breprexplema 31901 noextenddif 33175 noextendlt 33176 noextendgt 33177 fnsnbt 39140 |
Copyright terms: Public domain | W3C validator |