Theorem fundm2domnop0 11062

Description: A function with a domain containing (at least) two different elements is not an ordered pair. This theorem (which requires that ( G \ { (/) } ) needs to be a function instead of G) is useful for proofs for extensible structures, see structn0fun 13040. (Contributed by AV, 12-Oct-2020.) (Revised by AV, 7-Jun-2021.) (Proof shortened by AV, 15-Nov-2021.)

Assertion

Ref	Expression
fundm2domnop0	|- ( ( Fun ( G \ { (/) } ) /\ 2o ~<_ dom G ) -> -. G e. ( _V X. _V ) )

Proof of Theorem fundm2domnop0

Dummy variables a b x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		2dom 6956	. . 3 |- ( 2o ~<_ dom G -> E. a e. dom G E. b e. dom G -. a = b )
2		elvv 4780	. . . . . . . 8 |- ( G e. ( _V X. _V ) <-> E. x E. y G = <. x , y >. )
3		difeq1 3315	. . . . . . . . . . . . 13 |- ( G = <. x , y >. -> ( G \ { (/) } ) = ( <. x , y >. \ { (/) } ) )
4	3	funeqd 5339	. . . . . . . . . . . 12 |- ( G = <. x , y >. -> ( Fun ( G \ { (/) } ) <-> Fun ( <. x , y >. \ { (/) } ) ) )
5		opwo0id 4334	. . . . . . . . . . . . . . 15 |- <. x , y >. = ( <. x , y >. \ { (/) } )
6	5	eqcomi 2233	. . . . . . . . . . . . . 14 |- ( <. x , y >. \ { (/) } ) = <. x , y >.
7	6	funeqi 5338	. . . . . . . . . . . . 13 |- ( Fun ( <. x , y >. \ { (/) } ) <-> Fun <. x , y >. )
8		dmeq 4922	. . . . . . . . . . . . . . . . 17 |- ( G = <. x , y >. -> dom G = dom <. x , y >. )
9	8	eleq2d 2299	. . . . . . . . . . . . . . . 16 |- ( G = <. x , y >. -> ( a e. dom G <-> a e. dom <. x , y >. ) )
10	8	eleq2d 2299	. . . . . . . . . . . . . . . 16 |- ( G = <. x , y >. -> ( b e. dom G <-> b e. dom <. x , y >. ) )
11	9, 10	anbi12d 473	. . . . . . . . . . . . . . 15 |- ( G = <. x , y >. -> ( ( a e. dom G /\ b e. dom G ) <-> ( a e. dom <. x , y >. /\ b e. dom <. x , y >. ) ) )
12		eqid 2229	. . . . . . . . . . . . . . . . . 18 |- <. x , y >. = <. x , y >.
13		vex 2802	. . . . . . . . . . . . . . . . . 18 |- x e. _V
14		vex 2802	. . . . . . . . . . . . . . . . . 18 |- y e. _V
15	12, 13, 14	funopdmsn 5818	. . . . . . . . . . . . . . . . 17 |- ( ( Fun <. x , y >. /\ a e. dom <. x , y >. /\ b e. dom <. x , y >. ) -> a = b )
16	15	3expb 1228	. . . . . . . . . . . . . . . 16 |- ( ( Fun <. x , y >. /\ ( a e. dom <. x , y >. /\ b e. dom <. x , y >. ) ) -> a = b )
17	16	expcom 116	. . . . . . . . . . . . . . 15 |- ( ( a e. dom <. x , y >. /\ b e. dom <. x , y >. ) -> ( Fun <. x , y >. -> a = b ) )
18	11, 17	biimtrdi 163	. . . . . . . . . . . . . 14 |- ( G = <. x , y >. -> ( ( a e. dom G /\ b e. dom G ) -> ( Fun <. x , y >. -> a = b ) ) )
19	18	com23 78	. . . . . . . . . . . . 13 |- ( G = <. x , y >. -> ( Fun <. x , y >. -> ( ( a e. dom G /\ b e. dom G ) -> a = b ) ) )
20	7, 19	biimtrid 152	. . . . . . . . . . . 12 |- ( G = <. x , y >. -> ( Fun ( <. x , y >. \ { (/) } ) -> ( ( a e. dom G /\ b e. dom G ) -> a = b ) ) )
21	4, 20	sylbid 150	. . . . . . . . . . 11 |- ( G = <. x , y >. -> ( Fun ( G \ { (/) } ) -> ( ( a e. dom G /\ b e. dom G ) -> a = b ) ) )
22	21	impcomd 255	. . . . . . . . . 10 |- ( G = <. x , y >. -> ( ( ( a e. dom G /\ b e. dom G ) /\ Fun ( G \ { (/) } ) ) -> a = b ) )
23	22	exlimivv 1943	. . . . . . . . 9 |- ( E. x E. y G = <. x , y >. -> ( ( ( a e. dom G /\ b e. dom G ) /\ Fun ( G \ { (/) } ) ) -> a = b ) )
24	23	com12 30	. . . . . . . 8 |- ( ( ( a e. dom G /\ b e. dom G ) /\ Fun ( G \ { (/) } ) ) -> ( E. x E. y G = <. x , y >. -> a = b ) )
25	2, 24	biimtrid 152	. . . . . . 7 |- ( ( ( a e. dom G /\ b e. dom G ) /\ Fun ( G \ { (/) } ) ) -> ( G e. ( _V X. _V ) -> a = b ) )
26	25	con3d 634	. . . . . 6 |- ( ( ( a e. dom G /\ b e. dom G ) /\ Fun ( G \ { (/) } ) ) -> ( -. a = b -> -. G e. ( _V X. _V ) ) )
27	26	ex 115	. . . . 5 |- ( ( a e. dom G /\ b e. dom G ) -> ( Fun ( G \ { (/) } ) -> ( -. a = b -> -. G e. ( _V X. _V ) ) ) )
28	27	com23 78	. . . 4 |- ( ( a e. dom G /\ b e. dom G ) -> ( -. a = b -> ( Fun ( G \ { (/) } ) -> -. G e. ( _V X. _V ) ) ) )
29	28	rexlimivv 2654	. . 3 |- ( E. a e. dom G E. b e. dom G -. a = b -> ( Fun ( G \ { (/) } ) -> -. G e. ( _V X. _V ) ) )
30	1, 29	syl 14	. 2 |- ( 2o ~<_ dom G -> ( Fun ( G \ { (/) } ) -> -. G e. ( _V X. _V ) ) )
31	30	impcom 125	1 |- ( ( Fun ( G \ { (/) } ) /\ 2o ~<_ dom G ) -> -. G e. ( _V X. _V ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   = wceq 1395   E.wex 1538   e. wcel 2200   E.wrex 2509   _Vcvv 2799   \ cdif 3194   (/)c0 3491   {csn 3666   <.cop 3669   class class class wbr 4082   X. cxp 4716   dom cdm 4718   Fun wfun 5311   2oc2o 6554   ~<_ cdom 6884

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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-id 4383  df-suc 4461  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fv 5325  df-1o 6560  df-2o 6561  df-dom 6887

This theorem is referenced by:  fundm2domnop  11063  fun2dmnop0  11064  funvtxdm2domval  15824  funiedgdm2domval  15825