Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fsn2 | Structured version Visualization version GIF version |
Description: A function that maps a singleton to a class is the singleton of an ordered pair. (Contributed by NM, 19-May-2004.) |
Ref | Expression |
---|---|
fsn2.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
fsn2 | ⊢ (𝐹:{𝐴}⟶𝐵 ↔ ((𝐹‘𝐴) ∈ 𝐵 ∧ 𝐹 = {〈𝐴, (𝐹‘𝐴)〉})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fsn2.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
2 | 1 | snid 4208 | . . . . 5 ⊢ 𝐴 ∈ {𝐴} |
3 | ffvelrn 6357 | . . . . 5 ⊢ ((𝐹:{𝐴}⟶𝐵 ∧ 𝐴 ∈ {𝐴}) → (𝐹‘𝐴) ∈ 𝐵) | |
4 | 2, 3 | mpan2 707 | . . . 4 ⊢ (𝐹:{𝐴}⟶𝐵 → (𝐹‘𝐴) ∈ 𝐵) |
5 | ffn 6045 | . . . . 5 ⊢ (𝐹:{𝐴}⟶𝐵 → 𝐹 Fn {𝐴}) | |
6 | dffn3 6054 | . . . . . . 7 ⊢ (𝐹 Fn {𝐴} ↔ 𝐹:{𝐴}⟶ran 𝐹) | |
7 | 6 | biimpi 206 | . . . . . 6 ⊢ (𝐹 Fn {𝐴} → 𝐹:{𝐴}⟶ran 𝐹) |
8 | imadmrn 5476 | . . . . . . . . 9 ⊢ (𝐹 “ dom 𝐹) = ran 𝐹 | |
9 | fndm 5990 | . . . . . . . . . 10 ⊢ (𝐹 Fn {𝐴} → dom 𝐹 = {𝐴}) | |
10 | 9 | imaeq2d 5466 | . . . . . . . . 9 ⊢ (𝐹 Fn {𝐴} → (𝐹 “ dom 𝐹) = (𝐹 “ {𝐴})) |
11 | 8, 10 | syl5eqr 2670 | . . . . . . . 8 ⊢ (𝐹 Fn {𝐴} → ran 𝐹 = (𝐹 “ {𝐴})) |
12 | fnsnfv 6258 | . . . . . . . . 9 ⊢ ((𝐹 Fn {𝐴} ∧ 𝐴 ∈ {𝐴}) → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) | |
13 | 2, 12 | mpan2 707 | . . . . . . . 8 ⊢ (𝐹 Fn {𝐴} → {(𝐹‘𝐴)} = (𝐹 “ {𝐴})) |
14 | 11, 13 | eqtr4d 2659 | . . . . . . 7 ⊢ (𝐹 Fn {𝐴} → ran 𝐹 = {(𝐹‘𝐴)}) |
15 | 14 | feq3d 6032 | . . . . . 6 ⊢ (𝐹 Fn {𝐴} → (𝐹:{𝐴}⟶ran 𝐹 ↔ 𝐹:{𝐴}⟶{(𝐹‘𝐴)})) |
16 | 7, 15 | mpbid 222 | . . . . 5 ⊢ (𝐹 Fn {𝐴} → 𝐹:{𝐴}⟶{(𝐹‘𝐴)}) |
17 | 5, 16 | syl 17 | . . . 4 ⊢ (𝐹:{𝐴}⟶𝐵 → 𝐹:{𝐴}⟶{(𝐹‘𝐴)}) |
18 | 4, 17 | jca 554 | . . 3 ⊢ (𝐹:{𝐴}⟶𝐵 → ((𝐹‘𝐴) ∈ 𝐵 ∧ 𝐹:{𝐴}⟶{(𝐹‘𝐴)})) |
19 | snssi 4339 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → {(𝐹‘𝐴)} ⊆ 𝐵) | |
20 | fss 6056 | . . . . 5 ⊢ ((𝐹:{𝐴}⟶{(𝐹‘𝐴)} ∧ {(𝐹‘𝐴)} ⊆ 𝐵) → 𝐹:{𝐴}⟶𝐵) | |
21 | 20 | ancoms 469 | . . . 4 ⊢ (({(𝐹‘𝐴)} ⊆ 𝐵 ∧ 𝐹:{𝐴}⟶{(𝐹‘𝐴)}) → 𝐹:{𝐴}⟶𝐵) |
22 | 19, 21 | sylan 488 | . . 3 ⊢ (((𝐹‘𝐴) ∈ 𝐵 ∧ 𝐹:{𝐴}⟶{(𝐹‘𝐴)}) → 𝐹:{𝐴}⟶𝐵) |
23 | 18, 22 | impbii 199 | . 2 ⊢ (𝐹:{𝐴}⟶𝐵 ↔ ((𝐹‘𝐴) ∈ 𝐵 ∧ 𝐹:{𝐴}⟶{(𝐹‘𝐴)})) |
24 | fvex 6201 | . . . 4 ⊢ (𝐹‘𝐴) ∈ V | |
25 | 1, 24 | fsn 6402 | . . 3 ⊢ (𝐹:{𝐴}⟶{(𝐹‘𝐴)} ↔ 𝐹 = {〈𝐴, (𝐹‘𝐴)〉}) |
26 | 25 | anbi2i 730 | . 2 ⊢ (((𝐹‘𝐴) ∈ 𝐵 ∧ 𝐹:{𝐴}⟶{(𝐹‘𝐴)}) ↔ ((𝐹‘𝐴) ∈ 𝐵 ∧ 𝐹 = {〈𝐴, (𝐹‘𝐴)〉})) |
27 | 23, 26 | bitri 264 | 1 ⊢ (𝐹:{𝐴}⟶𝐵 ↔ ((𝐹‘𝐴) ∈ 𝐵 ∧ 𝐹 = {〈𝐴, (𝐹‘𝐴)〉})) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ⊆ wss 3574 {csn 4177 〈cop 4183 dom cdm 5114 ran crn 5115 “ cima 5117 Fn wfn 5883 ⟶wf 5884 ‘cfv 5888 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 |
This theorem is referenced by: fsn2g 6405 fnressn 6425 fressnfv 6427 mapsnconst 7903 elixpsn 7947 en1 8023 mat1dimelbas 20277 0spth 26987 ldepsnlinclem1 42294 ldepsnlinclem2 42295 |
Copyright terms: Public domain | W3C validator |