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

Theorem 2elresin 5328
Description: Membership in two functions restricted by each other's domain. (Contributed by NM, 8-Aug-1994.)
Assertion
Ref Expression
2elresin  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( ( <. x ,  y >.  e.  F  /\  <. x ,  z
>.  e.  G )  <->  ( <. x ,  y >.  e.  ( F  |`  ( A  i^i  B ) )  /\  <.
x ,  z >.  e.  ( G  |`  ( A  i^i  B ) ) ) ) )

Proof of Theorem 2elresin
StepHypRef Expression
1 fnop 5320 . . . . . . . 8  |-  ( ( F  Fn  A  /\  <.
x ,  y >.  e.  F )  ->  x  e.  A )
2 fnop 5320 . . . . . . . 8  |-  ( ( G  Fn  B  /\  <.
x ,  z >.  e.  G )  ->  x  e.  B )
31, 2anim12i 338 . . . . . . 7  |-  ( ( ( F  Fn  A  /\  <. x ,  y
>.  e.  F )  /\  ( G  Fn  B  /\  <. x ,  z
>.  e.  G ) )  ->  ( x  e.  A  /\  x  e.  B ) )
43an4s 588 . . . . . 6  |-  ( ( ( F  Fn  A  /\  G  Fn  B
)  /\  ( <. x ,  y >.  e.  F  /\  <. x ,  z
>.  e.  G ) )  ->  ( x  e.  A  /\  x  e.  B ) )
5 elin 3319 . . . . . 6  |-  ( x  e.  ( A  i^i  B )  <->  ( x  e.  A  /\  x  e.  B ) )
64, 5sylibr 134 . . . . 5  |-  ( ( ( F  Fn  A  /\  G  Fn  B
)  /\  ( <. x ,  y >.  e.  F  /\  <. x ,  z
>.  e.  G ) )  ->  x  e.  ( A  i^i  B ) )
7 vex 2741 . . . . . . . 8  |-  y  e. 
_V
87opres 4917 . . . . . . 7  |-  ( x  e.  ( A  i^i  B )  ->  ( <. x ,  y >.  e.  ( F  |`  ( A  i^i  B ) )  <->  <. x ,  y >.  e.  F
) )
9 vex 2741 . . . . . . . 8  |-  z  e. 
_V
109opres 4917 . . . . . . 7  |-  ( x  e.  ( A  i^i  B )  ->  ( <. x ,  z >.  e.  ( G  |`  ( A  i^i  B ) )  <->  <. x ,  z >.  e.  G
) )
118, 10anbi12d 473 . . . . . 6  |-  ( x  e.  ( A  i^i  B )  ->  ( ( <. x ,  y >.  e.  ( F  |`  ( A  i^i  B ) )  /\  <. x ,  z
>.  e.  ( G  |`  ( A  i^i  B ) ) )  <->  ( <. x ,  y >.  e.  F  /\  <. x ,  z
>.  e.  G ) ) )
1211biimprd 158 . . . . 5  |-  ( x  e.  ( A  i^i  B )  ->  ( ( <. x ,  y >.  e.  F  /\  <. x ,  z >.  e.  G
)  ->  ( <. x ,  y >.  e.  ( F  |`  ( A  i^i  B ) )  /\  <.
x ,  z >.  e.  ( G  |`  ( A  i^i  B ) ) ) ) )
136, 12syl 14 . . . 4  |-  ( ( ( F  Fn  A  /\  G  Fn  B
)  /\  ( <. x ,  y >.  e.  F  /\  <. x ,  z
>.  e.  G ) )  ->  ( ( <.
x ,  y >.  e.  F  /\  <. x ,  z >.  e.  G
)  ->  ( <. x ,  y >.  e.  ( F  |`  ( A  i^i  B ) )  /\  <.
x ,  z >.  e.  ( G  |`  ( A  i^i  B ) ) ) ) )
1413ex 115 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( ( <. x ,  y >.  e.  F  /\  <. x ,  z
>.  e.  G )  -> 
( ( <. x ,  y >.  e.  F  /\  <. x ,  z
>.  e.  G )  -> 
( <. x ,  y
>.  e.  ( F  |`  ( A  i^i  B ) )  /\  <. x ,  z >.  e.  ( G  |`  ( A  i^i  B ) ) ) ) ) )
1514pm2.43d 50 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( ( <. x ,  y >.  e.  F  /\  <. x ,  z
>.  e.  G )  -> 
( <. x ,  y
>.  e.  ( F  |`  ( A  i^i  B ) )  /\  <. x ,  z >.  e.  ( G  |`  ( A  i^i  B ) ) ) ) )
16 resss 4932 . . . 4  |-  ( F  |`  ( A  i^i  B
) )  C_  F
1716sseli 3152 . . 3  |-  ( <.
x ,  y >.  e.  ( F  |`  ( A  i^i  B ) )  ->  <. x ,  y
>.  e.  F )
18 resss 4932 . . . 4  |-  ( G  |`  ( A  i^i  B
) )  C_  G
1918sseli 3152 . . 3  |-  ( <.
x ,  z >.  e.  ( G  |`  ( A  i^i  B ) )  ->  <. x ,  z
>.  e.  G )
2017, 19anim12i 338 . 2  |-  ( (
<. x ,  y >.  e.  ( F  |`  ( A  i^i  B ) )  /\  <. x ,  z
>.  e.  ( G  |`  ( A  i^i  B ) ) )  ->  ( <. x ,  y >.  e.  F  /\  <. x ,  z >.  e.  G
) )
2115, 20impbid1 142 1  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( ( <. x ,  y >.  e.  F  /\  <. x ,  z
>.  e.  G )  <->  ( <. x ,  y >.  e.  ( F  |`  ( A  i^i  B ) )  /\  <.
x ,  z >.  e.  ( G  |`  ( A  i^i  B ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2148    i^i cin 3129   <.cop 3596    |` cres 4629    Fn wfn 5212
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2740  df-un 3134  df-in 3136  df-ss 3143  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-br 4005  df-opab 4066  df-xp 4633  df-rel 4634  df-dm 4637  df-res 4639  df-fun 5219  df-fn 5220
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator