| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trin | Structured version Visualization version GIF version | ||
| Description: The intersection of transitive classes is transitive. (Contributed by NM, 9-May-1994.) |
| Ref | Expression |
|---|---|
| trin | ⊢ ((Tr 𝐴 ∧ Tr 𝐵) → Tr (𝐴 ∩ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elin 3924 | . . . . 5 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) | |
| 2 | trss 5233 | . . . . . 6 ⊢ (Tr 𝐴 → (𝑥 ∈ 𝐴 → 𝑥 ⊆ 𝐴)) | |
| 3 | trss 5233 | . . . . . 6 ⊢ (Tr 𝐵 → (𝑥 ∈ 𝐵 → 𝑥 ⊆ 𝐵)) | |
| 4 | 2, 3 | im2anan9 632 | . . . . 5 ⊢ ((Tr 𝐴 ∧ Tr 𝐵) → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) → (𝑥 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝐵))) |
| 5 | 1, 4 | biimtrid 245 | . . . 4 ⊢ ((Tr 𝐴 ∧ Tr 𝐵) → (𝑥 ∈ (𝐴 ∩ 𝐵) → (𝑥 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝐵))) |
| 6 | ssin 4194 | . . . 4 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝐵) ↔ 𝑥 ⊆ (𝐴 ∩ 𝐵)) | |
| 7 | 5, 6 | imbitrdi 254 | . . 3 ⊢ ((Tr 𝐴 ∧ Tr 𝐵) → (𝑥 ∈ (𝐴 ∩ 𝐵) → 𝑥 ⊆ (𝐴 ∩ 𝐵))) |
| 8 | 7 | ralrimiv 3159 | . 2 ⊢ ((Tr 𝐴 ∧ Tr 𝐵) → ∀𝑥 ∈ (𝐴 ∩ 𝐵)𝑥 ⊆ (𝐴 ∩ 𝐵)) |
| 9 | dftr3 5228 | . 2 ⊢ (Tr (𝐴 ∩ 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∩ 𝐵)𝑥 ⊆ (𝐴 ∩ 𝐵)) | |
| 10 | 8, 9 | sylibr 237 | 1 ⊢ ((Tr 𝐴 ∧ Tr 𝐵) → Tr (𝐴 ∩ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2146 ∀wral 3082 ∩ cin 3907 ⊆ wss 3908 Tr wtr 5223 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-v 3460 df-in 3915 df-ss 3925 df-uni 4878 df-tr 5224 |
| This theorem is used by: ordin 6398 tcmin 9718 ingru 10818 gruina 10821 dfon2lem4 36297 |
| Copyright terms: Public domain | W3C validator |