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

Theorem truni 4222
Description: The union of a class of transitive sets is transitive. Exercise 5(a) of [Enderton] p. 73. (Contributed by Scott Fenton, 21-Feb-2011.) (Proof shortened by Mario Carneiro, 26-Apr-2014.)
Assertion
Ref Expression
truni  |-  ( A. x  e.  A  Tr  x  ->  Tr  U. A )
Distinct variable group:    x, A

Proof of Theorem truni
StepHypRef Expression
1 triun 4221 . 2  |-  ( A. x  e.  A  Tr  x  ->  Tr  U_ x  e.  A  x )
2 uniiun 4045 . . 3  |-  U. A  =  U_ x  e.  A  x
3 treq 4214 . . 3  |-  ( U. A  =  U_ x  e.  A  x  ->  ( Tr  U. A  <->  Tr  U_ x  e.  A  x )
)
42, 3ax-mp 5 . 2  |-  ( Tr 
U. A  <->  Tr  U_ x  e.  A  x )
51, 4sylibr 134 1  |-  ( A. x  e.  A  Tr  x  ->  Tr  U. A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398   A.wral 2520   U.cuni 3914   U_ciun 3991   Tr wtr 4208
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-in 3217  df-ss 3224  df-uni 3915  df-iun 3993  df-tr 4209
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator