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

Theorem sorpssi 7777
Description: Property of a chain of sets. (Contributed by Stefan O'Rear, 2-Nov-2014.)
Assertion
Ref Expression
sorpssi (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵))

Proof of Theorem sorpssi
StepHypRef Expression
1 solin 5593 . . 3 (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 [⊊] 𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶 [⊊] 𝐵))
2 elex 3475 . . . . . 6 (𝐶 ∈ 𝐴 → 𝐶 ∈ V)
32ad2antll 742 . . . . 5 (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → 𝐶 ∈ V)
4 brrpssg 7773 . . . . 5 (𝐶 ∈ V → (𝐵 [⊊] 𝐶 ↔ 𝐵 ⊊ 𝐶))
53, 4syl 18 . . . 4 (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 [⊊] 𝐶 ↔ 𝐵 ⊊ 𝐶))
6 biidd 265 . . . 4 (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 = 𝐶 ↔ 𝐵 = 𝐶))
7 elex 3475 . . . . . 6 (𝐵 ∈ 𝐴 → 𝐵 ∈ V)
87ad2antrl 741 . . . . 5 (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → 𝐵 ∈ V)
9 brrpssg 7773 . . . . 5 (𝐵 ∈ V → (𝐶 [⊊] 𝐵 ↔ 𝐶 ⊊ 𝐵))
108, 9syl 18 . . . 4 (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐶 [⊊] 𝐵 ↔ 𝐶 ⊊ 𝐵))
115, 6, 103orbi123d 1464 . . 3 (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ((𝐵 [⊊] 𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶 [⊊] 𝐵) ↔ (𝐵 ⊊ 𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶 ⊊ 𝐵)))
121, 11mpbid 235 . 2 (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 ⊊ 𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶 ⊊ 𝐵))
13 sspsstri 4036 . 2 ((𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵) ↔ (𝐵 ⊊ 𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶 ⊊ 𝐵))
1412, 13sylibr 237 1 (( [⊊] Or 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∨ w3o 1102   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ⊊ wpss 4016   class class class wbr 5108   Or wor 5565   [⊊] crpss 7770
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-so 5567  df-xp 5664  df-rel 5665  df-rpss 7771
This theorem is used by:  sorpssun  7778  sorpssin  7779  sorpssuni  7780  sorpssint  7781  sorpsscmpl  7782  enfin2i  10438  fin1a2lem9  10525  fin1a2lem10  10526  fin1a2lem11  10527  fin1a2lem13  10529  ssdifidllem  21691  ssmxidllem  34102
  Copyright terms: Public domain W3C validator