![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > truni | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
truni | ⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∪ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | triun 4694 | . 2 ⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∪ 𝑥 ∈ 𝐴 𝑥) | |
2 | uniiun 4509 | . . 3 ⊢ ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝑥 | |
3 | treq 4686 | . . 3 ⊢ (∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝑥 → (Tr ∪ 𝐴 ↔ Tr ∪ 𝑥 ∈ 𝐴 𝑥)) | |
4 | 2, 3 | ax-mp 5 | . 2 ⊢ (Tr ∪ 𝐴 ↔ Tr ∪ 𝑥 ∈ 𝐴 𝑥) |
5 | 1, 4 | sylibr 223 | 1 ⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∪ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 = wceq 1475 ∀wral 2896 ∪ cuni 4372 ∪ ciun 4455 Tr wtr 4680 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-v 3175 df-in 3547 df-ss 3554 df-uni 4373 df-iun 4457 df-tr 4681 |
This theorem is referenced by: dfon2lem1 30932 |
Copyright terms: Public domain | W3C validator |