ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fun2dmnop0 Unicode version

Theorem fun2dmnop0 11222
Description: A function with a domain containing (at least) two different elements is not an ordered pair. This stronger version of fun2dmnop 11223 (with the less restrictive requirement that  ( G  \  { (/) } ) needs to be a function instead of  G) is useful for proofs for extensible structures, see structn0fun 13225. (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.
StepHypRef Expression
1 simpl1 1027 . . 3  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  Fun  ( G 
\  { (/) } ) )
2 dmexg 5021 . . . 4  |-  ( G  e.  ( _V  X.  _V )  ->  dom  G  e.  _V )
3 simpl3 1029 . . . . . 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
54prid1 3797 . . . . . . 7  |-  A  e. 
{ A ,  B }
65a1i 9 . . . . . 6  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  A  e.  { A ,  B }
)
73, 6sseldd 3239 . . . . 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
98prid2 3798 . . . . . . 7  |-  B  e. 
{ A ,  B }
109a1i 9 . . . . . 6  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  B  e.  { A ,  B }
)
113, 10sseldd 3239 . . . . 5  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  B  e.  dom  G )
12 simpl2 1028 . . . . 5  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  A  =/=  B )
13 neeq1 2425 . . . . . 6  |-  ( a  =  A  ->  (
a  =/=  b  <->  A  =/=  b ) )
14 neeq2 2426 . . . . . 6  |-  ( b  =  B  ->  ( A  =/=  b  <->  A  =/=  B ) )
1513, 14rspc2ev 2936 . . . . 5  |-  ( ( A  e.  dom  G  /\  B  e.  dom  G  /\  A  =/=  B
)  ->  E. a  e.  dom  G E. b  e.  dom  G  a  =/=  b )
167, 11, 12, 15syl3anc 1274 . . . 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 7063 . . . 4  |-  ( ( dom  G  e.  _V  /\ 
E. a  e.  dom  G E. b  e.  dom  G  a  =/=  b )  ->  2o  ~<_  dom  G
)
182, 16, 17syl2an2 598 . . 3  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  2o  ~<_  dom  G
)
19 fundm2domnop0 11220 . . 3  |-  ( ( Fun  ( G  \  { (/) } )  /\  2o 
~<_  dom  G )  ->  -.  G  e.  ( _V  X.  _V ) )
201, 18, 19syl2anc 411 . 2  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  -.  G  e.  ( _V  X.  _V ) )
2120pm2.01da 641 1  |-  ( ( Fun  ( G  \  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_ 
dom  G )  ->  -.  G  e.  ( _V  X.  _V ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 1005    e. wcel 2203    =/= wne 2412   E.wrex 2521   _Vcvv 2813    \ cdif 3208    C_ wss 3211   (/)c0 3508   {csn 3689   {cpr 3690   class class class wbr 4109    X. cxp 4747   dom cdm 4749   Fun wfun 5346   2oc2o 6641    ~<_ cdom 6974
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 619  ax-in2 620  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-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-1o 6647  df-2o 6648  df-en 6976  df-dom 6977
This theorem is referenced by:  fun2dmnop  11223  funvtxdm2vald  16026  funiedgdm2vald  16027
  Copyright terms: Public domain W3C validator