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

Theorem ssequn2 2779
Description: A relationship between subclass and union.
Assertion
Ref Expression
ssequn2 |- (A C_ B <-> (B u. A) = B)

Proof of Theorem ssequn2
StepHypRef Expression
1 ssequn1 2775 . 2 |- (A C_ B <-> (A u. B) = B)
2 uncom 2744 . . 3 |- (A u. B) = (B u. A)
32eqeq1i 1891 . 2 |- ((A u. B) = B <-> (B u. A) = B)
41, 3bitri 190 1 |- (A C_ B <-> (B u. A) = B)
Colors of variables: wff set class
Syntax hints:   <-> wb 163   = wceq 1298   u. cun 2591   C_ wss 2593
This theorem is referenced by:  unabs 2822  inundifOLD 2952  pwssun 3578  ordssun 3769  ordequn 3770  oneluni 3782  fodomr 5547  mapdom2 5588  pwfilem 5660  cldlp 9026  shs0i 11005  chj0i 11011  cmprelid2 14447  resrelfld 14448  isufil2 15565  ufileu 15573  filufint 15574  flimcls 15588
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-v 2294  df-un 2600  df-in 2603  df-ss 2605
Copyright terms: Public domain