![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > trint | Structured version Visualization version GIF version |
Description: The intersection of a class of transitive sets is transitive. Exercise 5(b) of [Enderton] p. 73. (Contributed by Scott Fenton, 25-Feb-2011.) (Proof shortened by BJ, 3-Oct-2022.) |
Ref | Expression |
---|---|
trint | ⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∩ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | triin 5244 | . 2 ⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∩ 𝑥 ∈ 𝐴 𝑥) | |
2 | intiin 5024 | . . 3 ⊢ ∩ 𝐴 = ∩ 𝑥 ∈ 𝐴 𝑥 | |
3 | treq 5235 | . . 3 ⊢ (∩ 𝐴 = ∩ 𝑥 ∈ 𝐴 𝑥 → (Tr ∩ 𝐴 ↔ Tr ∩ 𝑥 ∈ 𝐴 𝑥)) | |
4 | 2, 3 | ax-mp 5 | . 2 ⊢ (Tr ∩ 𝐴 ↔ Tr ∩ 𝑥 ∈ 𝐴 𝑥) |
5 | 1, 4 | sylibr 233 | 1 ⊢ (∀𝑥 ∈ 𝐴 Tr 𝑥 → Tr ∩ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1541 ∀wral 3060 ∩ cint 4912 ∩ ciin 4960 Tr wtr 5227 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-11 2154 ax-12 2171 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1544 df-ex 1782 df-nf 1786 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ral 3061 df-v 3448 df-in 3920 df-ss 3930 df-uni 4871 df-int 4913 df-iin 4962 df-tr 5228 |
This theorem is referenced by: tctr 9685 intwun 10680 intgru 10759 dfon2lem8 34451 |
Copyright terms: Public domain | W3C validator |