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

Theorem truni 5185
 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 5184 . 2 (∀𝑥𝐴 Tr 𝑥 → Tr 𝑥𝐴 𝑥)
2 uniiun 4981 . . 3 𝐴 = 𝑥𝐴 𝑥
3 treq 5177 . . 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 1533  ∀wral 3138  ∪ cuni 4837  ∪ ciun 4918  Tr wtr 5171 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-v 3496  df-in 3942  df-ss 3951  df-uni 4838  df-iun 4920  df-tr 5172 This theorem is referenced by:  dfon2lem1  33028
 Copyright terms: Public domain W3C validator