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

Theorem ordssun 2330
Description: Property of a subclass of the maximum (i.e. union) of two ordinals.
Assertion
Ref Expression
ordssun ((Ord B ∧ Ord C) → (A ⊆ (BC) ↔ (ABAC)))

Proof of Theorem ordssun
StepHypRef Expression
1 ordtri2or2 2329 . . 3 ((Ord B ∧ Ord C) → (BCCB))
2 ssequn1 1628 . . . . . 6 (BC ↔ (BC) = C)
3 sseq2 1522 . . . . . 6 ((BC) = C → (A ⊆ (BC) ↔ AC))
42, 3sylbi 174 . . . . 5 (BC → (A ⊆ (BC) ↔ AC))
5 olc 224 . . . . 5 (AC → (ABAC))
64, 5syl6bi 187 . . . 4 (BC → (A ⊆ (BC) → (ABAC)))
7 ssequn2 1631 . . . . . 6 (CB ↔ (BC) = B)
8 sseq2 1522 . . . . . 6 ((BC) = B → (A ⊆ (BC) ↔ AB))
97, 8sylbi 174 . . . . 5 (CB → (A ⊆ (BC) ↔ AB))
10 orc 225 . . . . 5 (AB → (ABAC))
119, 10syl6bi 187 . . . 4 (CB → (A ⊆ (BC) → (ABAC)))
126, 11jaoi 275 . . 3 ((BCCB) → (A ⊆ (BC) → (ABAC)))
131, 12syl 12 . 2 ((Ord B ∧ Ord C) → (A ⊆ (BC) → (ABAC)))
14 ssun 1634 . . 3 ((ABAC) → A ⊆ (BC))
1514a1i 7 . 2 ((Ord B ∧ Ord C) → ((ABAC) → A ⊆ (BC)))
1613, 15impbid 397 1 ((Ord B ∧ Ord C) → (A ⊆ (BC) ↔ (ABAC)))
Colors of variables: wff set class
Syntax hints:   → wi 2   ↔ wb 127   ∨ wo 195   ∧ wa 196   = wceq 1091   ∪ cun 1485   ⊆ wss 1487  Ord word 2198
This theorem is referenced by:  ordsucun 2333
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-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202
metamath.org