| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > triin | Structured version Visualization version GIF version | ||
| Description: An indexed intersection of a class of transitive sets is transitive. (Contributed by BJ, 3-Oct-2022.) |
| Ref | Expression |
|---|---|
| triin | ⊢ (∀𝑥 ∈ 𝐴 Tr 𝐵 → Tr ∩ 𝑥 ∈ 𝐴 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eliin 4926 | . . . . 5 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) | |
| 2 | 1 | elv 3436 | . . . 4 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) |
| 3 | r19.26 3099 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (Tr 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ (∀𝑥 ∈ 𝐴 Tr 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) | |
| 4 | trss 5189 | . . . . . . . 8 ⊢ (Tr 𝐵 → (𝑦 ∈ 𝐵 → 𝑦 ⊆ 𝐵)) | |
| 5 | 4 | imp 407 | . . . . . . 7 ⊢ ((Tr 𝐵 ∧ 𝑦 ∈ 𝐵) → 𝑦 ⊆ 𝐵) |
| 6 | 5 | ralimi 3076 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (Tr 𝐵 ∧ 𝑦 ∈ 𝐵) → ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝐵) |
| 7 | 3, 6 | sylbir 236 | . . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 Tr 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) → ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝐵) |
| 8 | ssiin 4985 | . . . . 5 ⊢ (𝑦 ⊆ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑦 ⊆ 𝐵) | |
| 9 | 7, 8 | sylibr 235 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 Tr 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) → 𝑦 ⊆ ∩ 𝑥 ∈ 𝐴 𝐵) |
| 10 | 2, 9 | sylan2b 600 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 Tr 𝐵 ∧ 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵) → 𝑦 ⊆ ∩ 𝑥 ∈ 𝐴 𝐵) |
| 11 | 10 | ralrimiva 3131 | . 2 ⊢ (∀𝑥 ∈ 𝐴 Tr 𝐵 → ∀𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵𝑦 ⊆ ∩ 𝑥 ∈ 𝐴 𝐵) |
| 12 | dftr3 5184 | . 2 ⊢ (Tr ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵𝑦 ⊆ ∩ 𝑥 ∈ 𝐴 𝐵) | |
| 13 | 11, 12 | sylibr 235 | 1 ⊢ (∀𝑥 ∈ 𝐴 Tr 𝐵 → Tr ∩ 𝑥 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∈ wcel 2119 ∀wral 3053 Vcvv 3431 ⊆ wss 3883 ∩ ciin 4922 Tr wtr 5179 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-11 2168 ax-12 2189 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-ex 1787 df-nf 1791 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ral 3054 df-v 3433 df-ss 3900 df-uni 4839 df-iin 4924 df-tr 5180 |
| This theorem is referenced by: trint 5197 |
| Copyright terms: Public domain | W3C validator |