Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > trintss | Structured version Visualization version GIF version |
Description: Any nonempty transitive class includes its intersection. Exercise 3 in [TakeutiZaring] p. 44 (which mistakenly does not include the nonemptiness hypothesis). (Contributed by Scott Fenton, 3-Mar-2011.) (Proof shortened by Andrew Salmon, 14-Nov-2011.) |
Ref | Expression |
---|---|
trintss | ⊢ ((Tr 𝐴 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0 4309 | . . 3 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
2 | intss1 4883 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → ∩ 𝐴 ⊆ 𝑥) | |
3 | trss 5173 | . . . . . 6 ⊢ (Tr 𝐴 → (𝑥 ∈ 𝐴 → 𝑥 ⊆ 𝐴)) | |
4 | 3 | com12 32 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → (Tr 𝐴 → 𝑥 ⊆ 𝐴)) |
5 | sstr2 3973 | . . . . 5 ⊢ (∩ 𝐴 ⊆ 𝑥 → (𝑥 ⊆ 𝐴 → ∩ 𝐴 ⊆ 𝐴)) | |
6 | 2, 4, 5 | sylsyld 61 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (Tr 𝐴 → ∩ 𝐴 ⊆ 𝐴)) |
7 | 6 | exlimiv 1927 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (Tr 𝐴 → ∩ 𝐴 ⊆ 𝐴)) |
8 | 1, 7 | sylbi 219 | . 2 ⊢ (𝐴 ≠ ∅ → (Tr 𝐴 → ∩ 𝐴 ⊆ 𝐴)) |
9 | 8 | impcom 410 | 1 ⊢ ((Tr 𝐴 ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ⊆ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∃wex 1776 ∈ wcel 2110 ≠ wne 3016 ⊆ wss 3935 ∅c0 4290 ∩ cint 4868 Tr wtr 5164 |
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-ne 3017 df-ral 3143 df-v 3496 df-dif 3938 df-in 3942 df-ss 3951 df-nul 4291 df-uni 4832 df-int 4869 df-tr 5165 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |