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

Theorem fliftcnv 5664
Description: Converse of the relation  F. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
flift.1  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
flift.2  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
flift.3  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
Assertion
Ref Expression
fliftcnv  |-  ( ph  ->  `' F  =  ran  ( x  e.  X  |-> 
<. B ,  A >. ) )
Distinct variable groups:    x, R    ph, x    x, X    x, S
Allowed substitution hints:    A( x)    B( x)    F( x)

Proof of Theorem fliftcnv
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2117 . . . . 5  |-  ran  (
x  e.  X  |->  <. B ,  A >. )  =  ran  ( x  e.  X  |->  <. B ,  A >. )
2 flift.3 . . . . 5  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
3 flift.2 . . . . 5  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
41, 2, 3fliftrel 5661 . . . 4  |-  ( ph  ->  ran  ( x  e.  X  |->  <. B ,  A >. )  C_  ( S  X.  R ) )
5 relxp 4618 . . . 4  |-  Rel  ( S  X.  R )
6 relss 4596 . . . 4  |-  ( ran  ( x  e.  X  |-> 
<. B ,  A >. ) 
C_  ( S  X.  R )  ->  ( Rel  ( S  X.  R
)  ->  Rel  ran  (
x  e.  X  |->  <. B ,  A >. ) ) )
74, 5, 6mpisyl 1407 . . 3  |-  ( ph  ->  Rel  ran  ( x  e.  X  |->  <. B ,  A >. ) )
8 relcnv 4887 . . 3  |-  Rel  `' F
97, 8jctil 310 . 2  |-  ( ph  ->  ( Rel  `' F  /\  Rel  ran  ( x  e.  X  |->  <. B ,  A >. ) ) )
10 flift.1 . . . . . . 7  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
1110, 3, 2fliftel 5662 . . . . . 6  |-  ( ph  ->  ( z F y  <->  E. x  e.  X  ( z  =  A  /\  y  =  B ) ) )
12 vex 2663 . . . . . . 7  |-  y  e. 
_V
13 vex 2663 . . . . . . 7  |-  z  e. 
_V
1412, 13brcnv 4692 . . . . . 6  |-  ( y `' F z  <->  z F
y )
15 ancom 264 . . . . . . 7  |-  ( ( y  =  B  /\  z  =  A )  <->  ( z  =  A  /\  y  =  B )
)
1615rexbii 2419 . . . . . 6  |-  ( E. x  e.  X  ( y  =  B  /\  z  =  A )  <->  E. x  e.  X  ( z  =  A  /\  y  =  B )
)
1711, 14, 163bitr4g 222 . . . . 5  |-  ( ph  ->  ( y `' F
z  <->  E. x  e.  X  ( y  =  B  /\  z  =  A ) ) )
181, 2, 3fliftel 5662 . . . . 5  |-  ( ph  ->  ( y ran  (
x  e.  X  |->  <. B ,  A >. ) z  <->  E. x  e.  X  ( y  =  B  /\  z  =  A ) ) )
1917, 18bitr4d 190 . . . 4  |-  ( ph  ->  ( y `' F
z  <->  y ran  (
x  e.  X  |->  <. B ,  A >. ) z ) )
20 df-br 3900 . . . 4  |-  ( y `' F z  <->  <. y ,  z >.  e.  `' F )
21 df-br 3900 . . . 4  |-  ( y ran  ( x  e.  X  |->  <. B ,  A >. ) z  <->  <. y ,  z >.  e.  ran  ( x  e.  X  |-> 
<. B ,  A >. ) )
2219, 20, 213bitr3g 221 . . 3  |-  ( ph  ->  ( <. y ,  z
>.  e.  `' F  <->  <. y ,  z >.  e.  ran  ( x  e.  X  |-> 
<. B ,  A >. ) ) )
2322eqrelrdv2 4608 . 2  |-  ( ( ( Rel  `' F  /\  Rel  ran  ( x  e.  X  |->  <. B ,  A >. ) )  /\  ph )  ->  `' F  =  ran  ( x  e.  X  |->  <. B ,  A >. ) )
249, 23mpancom 418 1  |-  ( ph  ->  `' F  =  ran  ( x  e.  X  |-> 
<. B ,  A >. ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1316    e. wcel 1465   E.wrex 2394    C_ wss 3041   <.cop 3500   class class class wbr 3899    |-> cmpt 3959    X. cxp 4507   `'ccnv 4508   ran crn 4510   Rel wrel 4514
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-rab 2402  df-v 2662  df-sbc 2883  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-br 3900  df-opab 3960  df-mpt 3961  df-id 4185  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-rn 4520  df-res 4521  df-ima 4522  df-iota 5058  df-fun 5095  df-fn 5096  df-f 5097  df-fv 5101
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator