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

Theorem tpossym 6547
Description: Two ways to say a function is symmetric. (Contributed by Mario Carneiro, 4-Oct-2015.)
Assertion
Ref Expression
tpossym  |-  ( F  Fn  ( A  X.  A )  ->  (tpos  F  =  F  <->  A. x  e.  A  A. y  e.  A  ( x F y )  =  ( y F x ) ) )
Distinct variable groups:    x, y, A   
x, F, y

Proof of Theorem tpossym
StepHypRef Expression
1 tposfn 6544 . . 3  |-  ( F  Fn  ( A  X.  A )  -> tpos  F  Fn  ( A  X.  A
) )
2 eqfnov2 6196 . . 3  |-  ( (tpos 
F  Fn  ( A  X.  A )  /\  F  Fn  ( A  X.  A ) )  -> 
(tpos  F  =  F  <->  A. x  e.  A  A. y  e.  A  (
xtpos  F y )  =  ( x F y ) ) )
31, 2mpancom 426 . 2  |-  ( F  Fn  ( A  X.  A )  ->  (tpos  F  =  F  <->  A. x  e.  A  A. y  e.  A  ( xtpos  F y )  =  ( x F y ) ) )
4 eqcom 2240 . . . 4  |-  ( ( xtpos  F y )  =  ( x F y )  <->  ( x F y )  =  ( xtpos  F y ) )
5 vex 2824 . . . . . 6  |-  x  e. 
_V
6 vex 2824 . . . . . 6  |-  y  e. 
_V
7 ovtposg 6530 . . . . . 6  |-  ( ( x  e.  _V  /\  y  e.  _V )  ->  ( xtpos  F y )  =  ( y F x ) )
85, 6, 7mp2an 430 . . . . 5  |-  ( xtpos 
F y )  =  ( y F x )
98eqeq2i 2249 . . . 4  |-  ( ( x F y )  =  ( xtpos  F
y )  <->  ( x F y )  =  ( y F x ) )
104, 9bitri 184 . . 3  |-  ( ( xtpos  F y )  =  ( x F y )  <->  ( x F y )  =  ( y F x ) )
11102ralbii 2558 . 2  |-  ( A. x  e.  A  A. y  e.  A  (
xtpos  F y )  =  ( x F y )  <->  A. x  e.  A  A. y  e.  A  ( x F y )  =  ( y F x ) )
123, 11bitrdi 196 1  |-  ( F  Fn  ( A  X.  A )  ->  (tpos  F  =  F  <->  A. x  e.  A  A. y  e.  A  ( x F y )  =  ( y F x ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   _Vcvv 2821    X. cxp 4772    Fn wfn 5372  (class class class)co 6085  tpos ctpos 6515
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-csb 3148  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-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-ov 6088  df-tpos 6516
This theorem is used by:  xmettpos  15471
  Copyright terms: Public domain W3C validator