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

Theorem fncnv 5387
Description: Single-rootedness (see funcnv 5382) of a class cut down by a cross product. (Contributed by NM, 5-Mar-2007.)
Assertion
Ref Expression
fncnv  |-  ( `' ( R  i^i  ( A  X.  B ) )  Fn  B  <->  A. y  e.  B  E! x  e.  A  x R
y )
Distinct variable groups:    x, y, A   
x, B, y    x, R, y

Proof of Theorem fncnv
StepHypRef Expression
1 df-fn 5321 . 2  |-  ( `' ( R  i^i  ( A  X.  B ) )  Fn  B  <->  ( Fun  `' ( R  i^i  ( A  X.  B ) )  /\  dom  `' ( R  i^i  ( A  X.  B ) )  =  B ) )
2 df-rn 4730 . . . 4  |-  ran  ( R  i^i  ( A  X.  B ) )  =  dom  `' ( R  i^i  ( A  X.  B ) )
32eqeq1i 2237 . . 3  |-  ( ran  ( R  i^i  ( A  X.  B ) )  =  B  <->  dom  `' ( R  i^i  ( A  X.  B ) )  =  B )
43anbi2i 457 . 2  |-  ( ( Fun  `' ( R  i^i  ( A  X.  B ) )  /\  ran  ( R  i^i  ( A  X.  B ) )  =  B )  <->  ( Fun  `' ( R  i^i  ( A  X.  B ) )  /\  dom  `' ( R  i^i  ( A  X.  B ) )  =  B ) )
5 rninxp 5172 . . . . 5  |-  ( ran  ( R  i^i  ( A  X.  B ) )  =  B  <->  A. y  e.  B  E. x  e.  A  x R
y )
65anbi1i 458 . . . 4  |-  ( ( ran  ( R  i^i  ( A  X.  B
) )  =  B  /\  A. y  e.  B  E* x  e.  A  x R y )  <->  ( A. y  e.  B  E. x  e.  A  x R
y  /\  A. y  e.  B  E* x  e.  A  x R
y ) )
7 funcnv 5382 . . . . . 6  |-  ( Fun  `' ( R  i^i  ( A  X.  B
) )  <->  A. y  e.  ran  ( R  i^i  ( A  X.  B
) ) E* x  x ( R  i^i  ( A  X.  B
) ) y )
8 raleq 2728 . . . . . . 7  |-  ( ran  ( R  i^i  ( A  X.  B ) )  =  B  ->  ( A. y  e.  ran  ( R  i^i  ( A  X.  B ) ) E* x  x ( R  i^i  ( A  X.  B ) ) y  <->  A. y  e.  B  E* x  x ( R  i^i  ( A  X.  B ) ) y ) )
9 moanimv 2153 . . . . . . . . . 10  |-  ( E* x ( y  e.  B  /\  ( x  e.  A  /\  x R y ) )  <-> 
( y  e.  B  ->  E* x ( x  e.  A  /\  x R y ) ) )
10 brinxp2 4786 . . . . . . . . . . . 12  |-  ( x ( R  i^i  ( A  X.  B ) ) y  <->  ( x  e.  A  /\  y  e.  B  /\  x R y ) )
11 3anan12 1014 . . . . . . . . . . . 12  |-  ( ( x  e.  A  /\  y  e.  B  /\  x R y )  <->  ( y  e.  B  /\  (
x  e.  A  /\  x R y ) ) )
1210, 11bitri 184 . . . . . . . . . . 11  |-  ( x ( R  i^i  ( A  X.  B ) ) y  <->  ( y  e.  B  /\  ( x  e.  A  /\  x R y ) ) )
1312mobii 2114 . . . . . . . . . 10  |-  ( E* x  x ( R  i^i  ( A  X.  B ) ) y  <->  E* x ( y  e.  B  /\  ( x  e.  A  /\  x R y ) ) )
14 df-rmo 2516 . . . . . . . . . . 11  |-  ( E* x  e.  A  x R y  <->  E* x
( x  e.  A  /\  x R y ) )
1514imbi2i 226 . . . . . . . . . 10  |-  ( ( y  e.  B  ->  E* x  e.  A  x R y )  <->  ( y  e.  B  ->  E* x
( x  e.  A  /\  x R y ) ) )
169, 13, 153bitr4i 212 . . . . . . . . 9  |-  ( E* x  x ( R  i^i  ( A  X.  B ) ) y  <-> 
( y  e.  B  ->  E* x  e.  A  x R y ) )
17 biimt 241 . . . . . . . . 9  |-  ( y  e.  B  ->  ( E* x  e.  A  x R y  <->  ( y  e.  B  ->  E* x  e.  A  x R
y ) ) )
1816, 17bitr4id 199 . . . . . . . 8  |-  ( y  e.  B  ->  ( E* x  x ( R  i^i  ( A  X.  B ) ) y  <->  E* x  e.  A  x R y ) )
1918ralbiia 2544 . . . . . . 7  |-  ( A. y  e.  B  E* x  x ( R  i^i  ( A  X.  B
) ) y  <->  A. y  e.  B  E* x  e.  A  x R
y )
208, 19bitrdi 196 . . . . . 6  |-  ( ran  ( R  i^i  ( A  X.  B ) )  =  B  ->  ( A. y  e.  ran  ( R  i^i  ( A  X.  B ) ) E* x  x ( R  i^i  ( A  X.  B ) ) y  <->  A. y  e.  B  E* x  e.  A  x R y ) )
217, 20bitrid 192 . . . . 5  |-  ( ran  ( R  i^i  ( A  X.  B ) )  =  B  ->  ( Fun  `' ( R  i^i  ( A  X.  B
) )  <->  A. y  e.  B  E* x  e.  A  x R
y ) )
2221pm5.32i 454 . . . 4  |-  ( ( ran  ( R  i^i  ( A  X.  B
) )  =  B  /\  Fun  `' ( R  i^i  ( A  X.  B ) ) )  <->  ( ran  ( R  i^i  ( A  X.  B ) )  =  B  /\  A. y  e.  B  E* x  e.  A  x R
y ) )
23 r19.26 2657 . . . 4  |-  ( A. y  e.  B  ( E. x  e.  A  x R y  /\  E* x  e.  A  x R y )  <->  ( A. y  e.  B  E. x  e.  A  x R y  /\  A. y  e.  B  E* x  e.  A  x R y ) )
246, 22, 233bitr4i 212 . . 3  |-  ( ( ran  ( R  i^i  ( A  X.  B
) )  =  B  /\  Fun  `' ( R  i^i  ( A  X.  B ) ) )  <->  A. y  e.  B  ( E. x  e.  A  x R y  /\  E* x  e.  A  x R y ) )
25 ancom 266 . . 3  |-  ( ( Fun  `' ( R  i^i  ( A  X.  B ) )  /\  ran  ( R  i^i  ( A  X.  B ) )  =  B )  <->  ( ran  ( R  i^i  ( A  X.  B ) )  =  B  /\  Fun  `' ( R  i^i  ( A  X.  B ) ) ) )
26 reu5 2749 . . . 4  |-  ( E! x  e.  A  x R y  <->  ( E. x  e.  A  x R y  /\  E* x  e.  A  x R y ) )
2726ralbii 2536 . . 3  |-  ( A. y  e.  B  E! x  e.  A  x R y  <->  A. y  e.  B  ( E. x  e.  A  x R y  /\  E* x  e.  A  x R y ) )
2824, 25, 273bitr4i 212 . 2  |-  ( ( Fun  `' ( R  i^i  ( A  X.  B ) )  /\  ran  ( R  i^i  ( A  X.  B ) )  =  B )  <->  A. y  e.  B  E! x  e.  A  x R
y )
291, 4, 283bitr2i 208 1  |-  ( `' ( R  i^i  ( A  X.  B ) )  Fn  B  <->  A. y  e.  B  E! x  e.  A  x R
y )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1002    = wceq 1395   E*wmo 2078    e. wcel 2200   A.wral 2508   E.wrex 2509   E!wreu 2510   E*wrmo 2511    i^i cin 3196   class class class wbr 4083    X. cxp 4717   `'ccnv 4718   dom cdm 4719   ran crn 4720   Fun wfun 5312    Fn wfn 5313
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-fun 5320  df-fn 5321
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator