| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sorpss | Structured version Visualization version GIF version | ||
| Description: Express strict ordering under proper subsets, i.e. the notion of a chain of sets. (Contributed by Stefan O'Rear, 2-Nov-2014.) |
| Ref | Expression |
|---|---|
| sorpss | ⊢ ( [⊊] Or 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | porpss 7714 | . . 3 ⊢ [⊊] Po 𝐴 | |
| 2 | 1 | biantrur 539 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥) ↔ ( [⊊] Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥))) |
| 3 | sspsstri 4062 | . . . 4 ⊢ ((𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥) ↔ (𝑥 ⊊ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ⊊ 𝑥)) | |
| 4 | vex 3461 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 5 | 4 | brrpss 7713 | . . . . 5 ⊢ (𝑥 [⊊] 𝑦 ↔ 𝑥 ⊊ 𝑦) |
| 6 | biid 264 | . . . . 5 ⊢ (𝑥 = 𝑦 ↔ 𝑥 = 𝑦) | |
| 7 | vex 3461 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 8 | 7 | brrpss 7713 | . . . . 5 ⊢ (𝑦 [⊊] 𝑥 ↔ 𝑦 ⊊ 𝑥) |
| 9 | 5, 6, 8 | 3orbi123i 1172 | . . . 4 ⊢ ((𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥) ↔ (𝑥 ⊊ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ⊊ 𝑥)) |
| 10 | 3, 9 | bitr4i 281 | . . 3 ⊢ ((𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥) ↔ (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥)) |
| 11 | 10 | 2ralbii 3140 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥)) |
| 12 | df-so 5560 | . 2 ⊢ ( [⊊] Or 𝐴 ↔ ( [⊊] Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥))) | |
| 13 | 2, 11, 12 | 3bitr4ri 307 | 1 ⊢ ( [⊊] Or 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∨ wo 860 ∨ w3o 1100 ∀wral 3079 ⊆ wss 3907 ⊊ wpss 3908 class class class wbr 5104 Po wpo 5557 Or wor 5558 [⊊] crpss 7709 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5250 ax-pr 5394 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-br 5105 df-opab 5167 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-rpss 7710 |
| This theorem is referenced by: sorpsscmpl 7721 enfin2i 10293 fin1a2lem13 10384 |
| Copyright terms: Public domain | W3C validator |