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

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

Proof of Theorem ssequn2
StepHypRef Expression
1 ssequn1 2196 . 2 |- (A (_ B <-> (A u. B) = B)
2 uncom 2172 . . 3 |- (A u. B) = (B u. A)
32eqeq1i 1479 . 2 |- ((A u. B) = B <-> (B u. A) = B)
41, 3bitr 173 1 |- (A (_ B <-> (B u. A) = B)
Colors of variables: wff set class
Syntax hints:   <-> wb 146   = wceq 954   u. cun 2041   (_ wss 2043
This theorem is referenced by:  unabs 2234  pwssun 2822  ordssun 3074  ordequn 3075  onelun 3099  fodomr 4469  mapdom2 4480  pwfilem 4550  cldlp 7700  shs0 9310  chj0 9316
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-12 966  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-clab 1462  df-cleq 1467  df-clel 1470  df-v 1808  df-un 2046  df-in 2047  df-ss 2049
Copyright terms: Public domain