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

Theorem sorpss 7771
Description: Express strict ordering under proper subsets, i.e. the notion of a chain of sets. (Contributed by Stefan O'Rear, 2-Nov-2014.)
Assertion
Ref Expression
sorpss ( [⊊] Or 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥))
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem sorpss
StepHypRef Expression
1 porpss 7770 . . 3 [⊊] Po 𝐴
21biantrur 540 . 2 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥) ↔ ( [⊊] Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥)))
3 sspsstri 4036 . . . 4 ((𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥) ↔ (𝑥 ⊊ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ⊊ 𝑥))
4 vex 3458 . . . . . 6 𝑦 ∈ V
54brrpss 7769 . . . . 5 (𝑥 [⊊] 𝑦 ↔ 𝑥 ⊊ 𝑦)
6 biid 264 . . . . 5 (𝑥 = 𝑦 ↔ 𝑥 = 𝑦)
7 vex 3458 . . . . . 6 𝑥 ∈ V
87brrpss 7769 . . . . 5 (𝑦 [⊊] 𝑥 ↔ 𝑦 ⊊ 𝑥)
95, 6, 83orbi123i 1174 . . . 4 ((𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥) ↔ (𝑥 ⊊ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ⊊ 𝑥))
103, 9bitr4i 281 . . 3 ((𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥) ↔ (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥))
11102ralbii 3141 . 2 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥))
12 df-so 5565 . 2 ( [⊊] Or 𝐴 ↔ ( [⊊] Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥)))
132, 11, 123bitr4ri 307 1 ( [⊊] Or 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∨ w3o 1102  ∀wral 3080   ⊆ wss 3900   ⊊ wpss 4016   class class class wbr 5106   Po wpo 5562   Or wor 5563   [⊊] crpss 7765
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 5253  ax-pr 5396
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 4839  df-br 5107  df-opab 5172  df-po 5564  df-so 5565  df-xp 5662  df-rel 5663  df-rpss 7766
This theorem is used by:  sorpsscmpl  7777  enfin2i  10429  fin1a2lem13  10520
  Copyright terms: Public domain W3C validator