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

Theorem truni 4243
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 4242 . 2  |-  ( A. x  e.  A  Tr  x  ->  Tr  U_ x  e.  A  x )
2 uniiun 4066 . . 3  |-  U. A  =  U_ x  e.  A  x
3 treq 4235 . . 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
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    = wceq 1402   A.wral 2528   U.cuni 3935   U_ciun 4012   Tr wtr 4229
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-in 3226  df-ss 3233  df-uni 3936  df-iun 4014  df-tr 4230
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator