HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem soss 2140
Description: Subset theorem for the strict ordering predicate.
Assertion
Ref Expression
soss (AB → (R Or BR Or A))

Proof of Theorem soss
StepHypRef Expression
1 poss 2129 . . 3 (AB → (R Po BR Po A))
2 ssel 1502 . . . . . . . 8 (AB → (xAxB))
3 ssel 1502 . . . . . . . 8 (AB → (yAyB))
42, 3anim12d 431 . . . . . . 7 (AB → ((xAyA) → (xByB)))
54syl4d 28 . . . . . 6 (AB → (((xByB) → (xRyx = yyRx)) → ((xAyA) → (xRyx = yyRx))))
6519.20dv 946 . . . . 5 (AB → (∀y((xByB) → (xRyx = yyRx)) → ∀y((xAyA) → (xRyx = yyRx))))
7619.20dv 946 . . . 4 (AB → (∀xy((xByB) → (xRyx = yyRx)) → ∀xy((xAyA) → (xRyx = yyRx))))
8 r2al 1231 . . . 4 (∀xByB (xRyx = yyRx) ↔ ∀xy((xByB) → (xRyx = yyRx)))
9 r2al 1231 . . . 4 (∀xAyA (xRyx = yyRx) ↔ ∀xy((xAyA) → (xRyx = yyRx)))
107, 8, 93imtr4g 426 . . 3 (AB → (∀xByB (xRyx = yyRx) → ∀xAyA (xRyx = yyRx)))
111, 10anim12d 431 . 2 (AB → ((R Po B ∧ ∀xByB (xRyx = yyRx)) → (R Po A ∧ ∀xAyA (xRyx = yyRx))))
12 df-so 2138 . 2 (R Or B ↔ (R Po B ∧ ∀xByB (xRyx = yyRx)))
13 df-so 2138 . 2 (R Or A ↔ (R Po A ∧ ∀xAyA (xRyx = yyRx)))
1411, 12, 133imtr4g 426 1 (AB → (R Or BR Or A))
Colors of variables: wff set class
Syntax hints:   → wi 2   ∧ wa 196   ∨ w3o 580  ∀wal 672   = weq 797   ∈ wcel 1092  ∀wral 1201   ⊆ wss 1487   class class class wbr 2054   Po wpo 2058   Or wor 2059
This theorem is referenced by:  soeq2 2142  wess 2188
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-in 1491  df-ss 1492  df-po 2128  df-so 2138
metamath.org