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

Theorem fun2dmnop0 11280
Description: A function with a domain containing (at least) two different elements is not an ordered pair. This stronger version of fun2dmnop 11281 (with the less restrictive requirement that  ( G  \  { (/) } ) needs to be a function instead of  G) is useful for proofs for extensible structures, see structn0fun 13343. (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 1031 . . 3  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  Fun  ( G 
\  { (/) } ) )
2 dmexg 5041 . . . 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
54prid1 3813 . . . . . . 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 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
98prid2 3814 . . . . . . 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 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 ) )
1513, 14rspc2ev 2945 . . . . 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 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 7100 . . . 4  |-  ( ( dom  G  e.  _V  /\ 
E. a  e.  dom  G E. b  e.  dom  G  a  =/=  b )  ->  2o  ~<_  dom  G
)
182, 16, 17syl2an2 602 . . 3  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  2o  ~<_  dom  G
)
19 fundm2domnop0 11278 . . 3  |-  ( ( Fun  ( G  \  { (/) } )  /\  2o 
~<_  dom  G )  ->  -.  G  e.  ( _V  X.  _V ) )
201, 18, 19syl2anc 415 . 2  |-  ( ( ( Fun  ( G 
\  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_  dom  G )  /\  G  e.  ( _V  X.  _V )
)  ->  -.  G  e.  ( _V  X.  _V ) )
2120pm2.01da 645 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 1009    e. wcel 2209    =/= wne 2420   E.wrex 2529   _Vcvv 2821    \ cdif 3217    C_ wss 3220   (/)c0 3520   {csn 3705   {cpr 3706   class class class wbr 4125    X. cxp 4767   dom cdm 4769   Fun wfun 5366   2oc2o 6671    ~<_ cdom 7011
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 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 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-1o 6677  df-2o 6678  df-en 7013  df-dom 7014
This theorem is referenced by:  fun2dmnop  11281  funvtxdm2vald  16186  funiedgdm2vald  16187
  Copyright terms: Public domain W3C validator