Theorem funopdmsn 5869

Description: The domain of a function which is an ordered pair is a singleton. (Contributed by AV, 15-Nov-2021.) (Avoid depending on this detail.)

Hypotheses

Ref	Expression
funopdmsn.g	|- G = <. X , Y >.
funopdmsn.x	|- X e. V
funopdmsn.y	|- Y e. W

Assertion

Ref	Expression
funopdmsn	|- ( ( Fun G /\ A e. dom G /\ B e. dom G ) -> A = B )

Proof of Theorem funopdmsn

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funopdmsn.g	. . . . 5 |- G = <. X , Y >.
2	1	funeqi 5378	. . . 4 |- ( Fun G <-> Fun <. X , Y >. )
3		funopdmsn.x	. . . . . 6 |- X e. V
4	3	elexi 2828	. . . . 5 |- X e. _V
5		funopdmsn.y	. . . . . 6 |- Y e. W
6	5	elexi 2828	. . . . 5 |- Y e. _V
7	4, 6	funop 5866	. . . 4 |- ( Fun <. X , Y >. <-> E. x ( X = { x } /\ <. X , Y >. = { <. x , x >. } ) )
8	2, 7	bitri 184	. . 3 |- ( Fun G <-> E. x ( X = { x } /\ <. X , Y >. = { <. x , x >. } ) )
9	1	eqcomi 2238	. . . . . . 7 |- <. X , Y >. = G
10	9	eqeq1i 2242	. . . . . 6 |- ( <. X , Y >. = { <. x , x >. } <-> G = { <. x , x >. } )
11		dmeq 4961	. . . . . . . 8 |- ( G = { <. x , x >. } -> dom G = dom { <. x , x >. } )
12		vex 2818	. . . . . . . . 9 |- x e. _V
13	12	dmsnop 5241	. . . . . . . 8 |- dom { <. x , x >. } = { x }
14	11, 13	eqtrdi 2283	. . . . . . 7 |- ( G = { <. x , x >. } -> dom G = { x } )
15		eleq2 2298	. . . . . . . . 9 |- ( dom G = { x } -> ( A e. dom G <-> A e. { x } ) )
16		eleq2 2298	. . . . . . . . 9 |- ( dom G = { x } -> ( B e. dom G <-> B e. { x } ) )
17	15, 16	anbi12d 473	. . . . . . . 8 |- ( dom G = { x } -> ( ( A e. dom G /\ B e. dom G ) <-> ( A e. { x } /\ B e. { x } ) ) )
18		elsni 3712	. . . . . . . . 9 |- ( A e. { x } -> A = x )
19		elsni 3712	. . . . . . . . 9 |- ( B e. { x } -> B = x )
20		eqtr3 2254	. . . . . . . . 9 |- ( ( A = x /\ B = x ) -> A = B )
21	18, 19, 20	syl2an 289	. . . . . . . 8 |- ( ( A e. { x } /\ B e. { x } ) -> A = B )
22	17, 21	biimtrdi 163	. . . . . . 7 |- ( dom G = { x } -> ( ( A e. dom G /\ B e. dom G ) -> A = B ) )
23	14, 22	syl 14	. . . . . 6 |- ( G = { <. x , x >. } -> ( ( A e. dom G /\ B e. dom G ) -> A = B ) )
24	10, 23	sylbi 121	. . . . 5 |- ( <. X , Y >. = { <. x , x >. } -> ( ( A e. dom G /\ B e. dom G ) -> A = B ) )
25	24	adantl 277	. . . 4 |- ( ( X = { x } /\ <. X , Y >. = { <. x , x >. } ) -> ( ( A e. dom G /\ B e. dom G ) -> A = B ) )
26	25	exlimiv 1647	. . 3 |- ( E. x ( X = { x } /\ <. X , Y >. = { <. x , x >. } ) -> ( ( A e. dom G /\ B e. dom G ) -> A = B ) )
27	8, 26	sylbi 121	. 2 |- ( Fun G -> ( ( A e. dom G /\ B e. dom G ) -> A = B ) )
28	27	3impib 1228	1 |- ( ( Fun G /\ A e. dom G /\ B e. dom G ) -> A = B )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   E.wex 1541   e. wcel 2205   {csn 3694   <.cop 3697   dom cdm 4754   Fun wfun 5351

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-fun 5359

This theorem is referenced by:  fundm2domnop0  11245