Theorem fun2dmnop0 11302

Description: A function with a domain containing (at least) two different elements is not an ordered pair. This stronger version of fun2dmnop 11303 (with the less restrictive requirement that ( G \ { (/) } ) needs to be a function instead of G) is useful for proofs for extensible structures, see structn0fun 13365. (Contributed by AV, 21-Sep-2020.) (Revised by AV, 7-Jun-2021.)

Hypotheses

Ref	Expression
fun2dmnop.a	|- A e. _V
fun2dmnop.b	|- B e. _V

Assertion

Ref	Expression
fun2dmnop0	|- ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) -> -. G e. ( _V X. _V ) )

Proof of Theorem fun2dmnop0

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

Step	Hyp	Ref	Expression
1		simpl1 1031	. . 3 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> Fun ( G \ { (/) } ) )
2		dmexg 5046	. . . 4 |- ( G e. ( _V X. _V ) -> dom G e. _V )
3		simpl3 1033	. . . . . 6 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> { A , B } C_ dom G )
4		fun2dmnop.a	. . . . . . . 8 |- A e. _V
5	4	prid1 3817	. . . . . . 7 |- A e. { A , B }
6	5	a1i 9	. . . . . 6 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> A e. { A , B } )
7	3, 6	sseldd 3249	. . . . 5 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> A e. dom G )
8		fun2dmnop.b	. . . . . . . 8 |- B e. _V
9	8	prid2 3818	. . . . . . 7 |- B e. { A , B }
10	9	a1i 9	. . . . . 6 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> B e. { A , B } )
11	3, 10	sseldd 3249	. . . . 5 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> B e. dom G )
12		simpl2 1032	. . . . 5 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> A =/= B )
13		neeq1 2433	. . . . . 6 |- ( a = A -> ( a =/= b <-> A =/= b ) )
14		neeq2 2434	. . . . . 6 |- ( b = B -> ( A =/= b <-> A =/= B ) )
15	13, 14	rspc2ev 2945	. . . . 5 |- ( ( A e. dom G /\ B e. dom G /\ A =/= B ) -> E. a e. dom G E. b e. dom G a =/= b )
16	7, 11, 12, 15	syl3anc 1278	. . . 4 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> E. a e. dom G E. b e. dom G a =/= b )
17		rex2dom 7110	. . . 4 |- ( ( dom G e. _V /\ E. a e. dom G E. b e. dom G a =/= b ) -> 2o ~<_ dom G )
18	2, 16, 17	syl2an2 602	. . 3 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> 2o ~<_ dom G )
19		fundm2domnop0 11300	. . 3 |- ( ( Fun ( G \ { (/) } ) /\ 2o ~<_ dom G ) -> -. G e. ( _V X. _V ) )
20	1, 18, 19	syl2anc 415	. 2 |- ( ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) /\ G e. ( _V X. _V ) ) -> -. G e. ( _V X. _V ) )
21	20	pm2.01da 645	1 |- ( ( Fun ( G \ { (/) } ) /\ A =/= B /\ { A , B } C_ dom G ) -> -. G e. ( _V X. _V ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   /\ w3a 1009   e. wcel 2209   =/= wne 2420   E.wrex 2529   _Vcvv 2821   \ cdif 3217   C_ wss 3220   (/)c0 3520   {csn 3709   {cpr 3710   class class class wbr 4130   X. cxp 4772   dom cdm 4774   Fun wfun 5371   2oc2o 6681   ~<_ cdom 7021

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1o 6687  df-2o 6688  df-en 7023  df-dom 7024

This theorem is used by:  fun2dmnop  11303  funvtxdm2vald  16272  funiedgdm2vald  16273