MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  truni Structured version   Visualization version   GIF version

Theorem truni 5186
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 (∀𝑥𝐴 Tr 𝑥 → Tr 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem truni
StepHypRef Expression
1 triun 5185 . 2 (∀𝑥𝐴 Tr 𝑥 → Tr 𝑥𝐴 𝑥)
2 uniiun 4982 . . 3 𝐴 = 𝑥𝐴 𝑥
3 treq 5178 . . 3 ( 𝐴 = 𝑥𝐴 𝑥 → (Tr 𝐴 ↔ Tr 𝑥𝐴 𝑥))
42, 3ax-mp 5 . 2 (Tr 𝐴 ↔ Tr 𝑥𝐴 𝑥)
51, 4sylibr 236 1 (∀𝑥𝐴 Tr 𝑥 → Tr 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1537  wral 3138   cuni 4838   ciun 4919  Tr wtr 5172
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-v 3496  df-in 3943  df-ss 3952  df-uni 4839  df-iun 4921  df-tr 5173
This theorem is referenced by:  dfon2lem1  33028
  Copyright terms: Public domain W3C validator