| 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 7668 | . . 3 ⊢ [⊊] Po 𝐴 | |
| 2 | 1 | biantrur 530 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥) ↔ ( [⊊] Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥))) |
| 3 | sspsstri 4054 | . . . 4 ⊢ ((𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥) ↔ (𝑥 ⊊ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ⊊ 𝑥)) | |
| 4 | vex 3441 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 5 | 4 | brrpss 7667 | . . . . 5 ⊢ (𝑥 [⊊] 𝑦 ↔ 𝑥 ⊊ 𝑦) |
| 6 | biid 261 | . . . . 5 ⊢ (𝑥 = 𝑦 ↔ 𝑥 = 𝑦) | |
| 7 | vex 3441 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 8 | 7 | brrpss 7667 | . . . . 5 ⊢ (𝑦 [⊊] 𝑥 ↔ 𝑦 ⊊ 𝑥) |
| 9 | 5, 6, 8 | 3orbi123i 1156 | . . . 4 ⊢ ((𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥) ↔ (𝑥 ⊊ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ⊊ 𝑥)) |
| 10 | 3, 9 | bitr4i 278 | . . 3 ⊢ ((𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥) ↔ (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥)) |
| 11 | 10 | 2ralbii 3108 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥)) |
| 12 | df-so 5530 | . 2 ⊢ ( [⊊] Or 𝐴 ↔ ( [⊊] Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 [⊊] 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 [⊊] 𝑥))) | |
| 13 | 2, 11, 12 | 3bitr4ri 304 | 1 ⊢ ( [⊊] Or 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∨ wo 847 ∨ w3o 1085 ∀wral 3048 ⊆ wss 3898 ⊊ wpss 3899 class class class wbr 5095 Po wpo 5527 Or wor 5528 [⊊] crpss 7663 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2712 df-cleq 2725 df-clel 2808 df-ne 2930 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-br 5096 df-opab 5158 df-po 5529 df-so 5530 df-xp 5627 df-rel 5628 df-rpss 7664 |
| This theorem is referenced by: sorpsscmpl 7675 enfin2i 10221 fin1a2lem13 10312 |
| Copyright terms: Public domain | W3C validator |