Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  sorpssin Structured version   Visualization version   GIF version

Theorem sorpssin 7442
 Description: A chain of sets is closed under binary intersection. (Contributed by Mario Carneiro, 16-May-2015.)
Assertion
Ref Expression
sorpssin (( [] Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → (𝐵𝐶) ∈ 𝐴)

Proof of Theorem sorpssin
StepHypRef Expression
1 simprl 770 . . 3 (( [] Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → 𝐵𝐴)
2 df-ss 3925 . . . 4 (𝐵𝐶 ↔ (𝐵𝐶) = 𝐵)
3 eleq1 2901 . . . 4 ((𝐵𝐶) = 𝐵 → ((𝐵𝐶) ∈ 𝐴𝐵𝐴))
42, 3sylbi 220 . . 3 (𝐵𝐶 → ((𝐵𝐶) ∈ 𝐴𝐵𝐴))
51, 4syl5ibrcom 250 . 2 (( [] Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → (𝐵𝐶 → (𝐵𝐶) ∈ 𝐴))
6 simprr 772 . . 3 (( [] Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → 𝐶𝐴)
7 sseqin2 4166 . . . 4 (𝐶𝐵 ↔ (𝐵𝐶) = 𝐶)
8 eleq1 2901 . . . 4 ((𝐵𝐶) = 𝐶 → ((𝐵𝐶) ∈ 𝐴𝐶𝐴))
97, 8sylbi 220 . . 3 (𝐶𝐵 → ((𝐵𝐶) ∈ 𝐴𝐶𝐴))
106, 9syl5ibrcom 250 . 2 (( [] Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → (𝐶𝐵 → (𝐵𝐶) ∈ 𝐴))
11 sorpssi 7440 . 2 (( [] Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → (𝐵𝐶𝐶𝐵))
125, 10, 11mpjaod 857 1 (( [] Or 𝐴 ∧ (𝐵𝐴𝐶𝐴)) → (𝐵𝐶) ∈ 𝐴)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2114   ∩ cin 3907   ⊆ wss 3908   Or wor 5450   [⊊] crpss 7433 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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pr 5307 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4266  df-if 4440  df-sn 4540  df-pr 4542  df-op 4546  df-br 5043  df-opab 5105  df-so 5452  df-xp 5538  df-rel 5539  df-rpss 7434 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator