MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  itunitc Structured version   Unicode version

Theorem itunitc 8799
Description: The union of all union iterates creates the transitive closure; compare trcl 8157. (Contributed by Stefan O'Rear, 11-Feb-2015.)
Hypothesis
Ref Expression
ituni.u  |-  U  =  ( x  e.  _V  |->  ( rec ( ( y  e.  _V  |->  U. y
) ,  x )  |`  om ) )
Assertion
Ref Expression
itunitc  |-  ( TC
`  A )  = 
U. ran  ( U `  A )
Distinct variable group:    x, A, y
Allowed substitution hints:    U( x, y)

Proof of Theorem itunitc
Dummy variables  a 
b  c are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 5852 . . . 4  |-  ( a  =  A  ->  ( TC `  a )  =  ( TC `  A
) )
2 fveq2 5852 . . . . . 6  |-  ( a  =  A  ->  ( U `  a )  =  ( U `  A ) )
32rneqd 5216 . . . . 5  |-  ( a  =  A  ->  ran  ( U `  a )  =  ran  ( U `
 A ) )
43unieqd 4240 . . . 4  |-  ( a  =  A  ->  U. ran  ( U `  a )  =  U. ran  ( U `  A )
)
51, 4eqeq12d 2463 . . 3  |-  ( a  =  A  ->  (
( TC `  a
)  =  U. ran  ( U `  a )  <-> 
( TC `  A
)  =  U. ran  ( U `  A ) ) )
6 vex 3096 . . . . . . 7  |-  a  e. 
_V
7 ituni.u . . . . . . . 8  |-  U  =  ( x  e.  _V  |->  ( rec ( ( y  e.  _V  |->  U. y
) ,  x )  |`  om ) )
87ituni0 8796 . . . . . . 7  |-  ( a  e.  _V  ->  (
( U `  a
) `  (/) )  =  a )
96, 8ax-mp 5 . . . . . 6  |-  ( ( U `  a ) `
 (/) )  =  a
10 fvssunirn 5875 . . . . . 6  |-  ( ( U `  a ) `
 (/) )  C_  U. ran  ( U `  a )
119, 10eqsstr3i 3517 . . . . 5  |-  a  C_  U.
ran  ( U `  a )
12 dftr3 4530 . . . . . 6  |-  ( Tr 
U. ran  ( U `  a )  <->  A. b  e.  U. ran  ( U `
 a ) b 
C_  U. ran  ( U `
 a ) )
137itunifn 8795 . . . . . . . 8  |-  ( a  e.  _V  ->  ( U `  a )  Fn  om )
14 fnunirn 6146 . . . . . . . 8  |-  ( ( U `  a )  Fn  om  ->  (
b  e.  U. ran  ( U `  a )  <->  E. c  e.  om  b  e.  ( ( U `  a ) `  c ) ) )
156, 13, 14mp2b 10 . . . . . . 7  |-  ( b  e.  U. ran  ( U `  a )  <->  E. c  e.  om  b  e.  ( ( U `  a ) `  c
) )
16 elssuni 4260 . . . . . . . . 9  |-  ( b  e.  ( ( U `
 a ) `  c )  ->  b  C_ 
U. ( ( U `
 a ) `  c ) )
177itunisuc 8797 . . . . . . . . . 10  |-  ( ( U `  a ) `
 suc  c )  =  U. ( ( U `
 a ) `  c )
18 fvssunirn 5875 . . . . . . . . . 10  |-  ( ( U `  a ) `
 suc  c )  C_ 
U. ran  ( U `  a )
1917, 18eqsstr3i 3517 . . . . . . . . 9  |-  U. (
( U `  a
) `  c )  C_ 
U. ran  ( U `  a )
2016, 19syl6ss 3498 . . . . . . . 8  |-  ( b  e.  ( ( U `
 a ) `  c )  ->  b  C_ 
U. ran  ( U `  a ) )
2120rexlimivw 2930 . . . . . . 7  |-  ( E. c  e.  om  b  e.  ( ( U `  a ) `  c
)  ->  b  C_  U.
ran  ( U `  a ) )
2215, 21sylbi 195 . . . . . 6  |-  ( b  e.  U. ran  ( U `  a )  ->  b  C_  U. ran  ( U `  a )
)
2312, 22mprgbir 2805 . . . . 5  |-  Tr  U. ran  ( U `  a
)
24 tcmin 8170 . . . . . 6  |-  ( a  e.  _V  ->  (
( a  C_  U. ran  ( U `  a )  /\  Tr  U. ran  ( U `  a ) )  ->  ( TC `  a )  C_  U. ran  ( U `  a ) ) )
256, 24ax-mp 5 . . . . 5  |-  ( ( a  C_  U. ran  ( U `  a )  /\  Tr  U. ran  ( U `  a )
)  ->  ( TC `  a )  C_  U. ran  ( U `  a ) )
2611, 23, 25mp2an 672 . . . 4  |-  ( TC
`  a )  C_  U.
ran  ( U `  a )
27 unissb 4262 . . . . 5  |-  ( U. ran  ( U `  a
)  C_  ( TC `  a )  <->  A. b  e.  ran  ( U `  a ) b  C_  ( TC `  a ) )
28 fvelrnb 5901 . . . . . . 7  |-  ( ( U `  a )  Fn  om  ->  (
b  e.  ran  ( U `  a )  <->  E. c  e.  om  (
( U `  a
) `  c )  =  b ) )
296, 13, 28mp2b 10 . . . . . 6  |-  ( b  e.  ran  ( U `
 a )  <->  E. c  e.  om  ( ( U `
 a ) `  c )  =  b )
307itunitc1 8798 . . . . . . . . 9  |-  ( ( U `  a ) `
 c )  C_  ( TC `  a )
3130a1i 11 . . . . . . . 8  |-  ( c  e.  om  ->  (
( U `  a
) `  c )  C_  ( TC `  a
) )
32 sseq1 3507 . . . . . . . 8  |-  ( ( ( U `  a
) `  c )  =  b  ->  ( ( ( U `  a
) `  c )  C_  ( TC `  a
)  <->  b  C_  ( TC `  a ) ) )
3331, 32syl5ibcom 220 . . . . . . 7  |-  ( c  e.  om  ->  (
( ( U `  a ) `  c
)  =  b  -> 
b  C_  ( TC `  a ) ) )
3433rexlimiv 2927 . . . . . 6  |-  ( E. c  e.  om  (
( U `  a
) `  c )  =  b  ->  b  C_  ( TC `  a ) )
3529, 34sylbi 195 . . . . 5  |-  ( b  e.  ran  ( U `
 a )  -> 
b  C_  ( TC `  a ) )
3627, 35mprgbir 2805 . . . 4  |-  U. ran  ( U `  a ) 
C_  ( TC `  a )
3726, 36eqssi 3502 . . 3  |-  ( TC
`  a )  = 
U. ran  ( U `  a )
385, 37vtoclg 3151 . 2  |-  ( A  e.  _V  ->  ( TC `  A )  = 
U. ran  ( U `  A ) )
39 rn0 5240 . . . . 5  |-  ran  (/)  =  (/)
4039unieqi 4239 . . . 4  |-  U. ran  (/)  =  U. (/)
41 uni0 4257 . . . 4  |-  U. (/)  =  (/)
4240, 41eqtr2i 2471 . . 3  |-  (/)  =  U. ran  (/)
43 fvprc 5846 . . 3  |-  ( -.  A  e.  _V  ->  ( TC `  A )  =  (/) )
44 fvprc 5846 . . . . 5  |-  ( -.  A  e.  _V  ->  ( U `  A )  =  (/) )
4544rneqd 5216 . . . 4  |-  ( -.  A  e.  _V  ->  ran  ( U `  A
)  =  ran  (/) )
4645unieqd 4240 . . 3  |-  ( -.  A  e.  _V  ->  U.
ran  ( U `  A )  =  U. ran  (/) )
4742, 43, 463eqtr4a 2508 . 2  |-  ( -.  A  e.  _V  ->  ( TC `  A )  =  U. ran  ( U `  A )
)
4838, 47pm2.61i 164 1  |-  ( TC
`  A )  = 
U. ran  ( U `  A )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1381    e. wcel 1802   E.wrex 2792   _Vcvv 3093    C_ wss 3458   (/)c0 3767   U.cuni 4230    |-> cmpt 4491   Tr wtr 4526   suc csuc 4866   ran crn 4986    |` cres 4987    Fn wfn 5569   ` cfv 5574   omcom 6681   reccrdg 7073   TCctc 8165
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1603  ax-4 1616  ax-5 1689  ax-6 1732  ax-7 1774  ax-8 1804  ax-9 1806  ax-10 1821  ax-11 1826  ax-12 1838  ax-13 1983  ax-ext 2419  ax-rep 4544  ax-sep 4554  ax-nul 4562  ax-pow 4611  ax-pr 4672  ax-un 6573  ax-inf2 8056
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 973  df-3an 974  df-tru 1384  df-ex 1598  df-nf 1602  df-sb 1725  df-eu 2270  df-mo 2271  df-clab 2427  df-cleq 2433  df-clel 2436  df-nfc 2591  df-ne 2638  df-ral 2796  df-rex 2797  df-reu 2798  df-rab 2800  df-v 3095  df-sbc 3312  df-csb 3418  df-dif 3461  df-un 3463  df-in 3465  df-ss 3472  df-pss 3474  df-nul 3768  df-if 3923  df-pw 3995  df-sn 4011  df-pr 4013  df-tp 4015  df-op 4017  df-uni 4231  df-int 4268  df-iun 4313  df-br 4434  df-opab 4492  df-mpt 4493  df-tr 4527  df-eprel 4777  df-id 4781  df-po 4786  df-so 4787  df-fr 4824  df-we 4826  df-ord 4867  df-on 4868  df-lim 4869  df-suc 4870  df-xp 4991  df-rel 4992  df-cnv 4993  df-co 4994  df-dm 4995  df-rn 4996  df-res 4997  df-ima 4998  df-iota 5537  df-fun 5576  df-fn 5577  df-f 5578  df-f1 5579  df-fo 5580  df-f1o 5581  df-fv 5582  df-om 6682  df-recs 7040  df-rdg 7074  df-tc 8166
This theorem is referenced by:  hsmexlem5  8808
  Copyright terms: Public domain W3C validator