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

Theorem intssuni 3240
Description: The intersection of a nonempty set is a subclass of its union.
Assertion
Ref Expression
intssuni |- (A =/= (/) -> |^|A C_ U.A)

Proof of Theorem intssuni
StepHypRef Expression
1 r19.2z 2958 . . . 4 |- ((A =/= (/) /\ A.y e. A x e. y) -> E.y e. A x e. y)
21ex 402 . . 3 |- (A =/= (/) -> (A.y e. A x e. y -> E.y e. A x e. y))
3 visset 2295 . . . 4 |- x e. _V
43elint2 3221 . . 3 |- (x e. |^|A <-> A.y e. A x e. y)
5 eluni2 3181 . . 3 |- (x e. U.A <-> E.y e. A x e. y)
62, 4, 53imtr4g 612 . 2 |- (A =/= (/) -> (x e. |^|A -> x e. U.A))
76ssrdv 2622 1 |- (A =/= (/) -> |^|A C_ U.A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   e. wcel 1300   =/= wne 2017  A.wral 2105  E.wrex 2106   C_ wss 2593  (/)c0 2875  U.cuni 3177  |^|cint 3214
This theorem is referenced by:  unissint 3241  unissintOLD 3242  intssuni2 3243  dfon2lem8 13856  inttrp 14437  intidl 16177
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-ne 2019  df-ral 2109  df-rex 2110  df-v 2294  df-dif 2597  df-in 2603  df-ss 2605  df-nul 2876  df-uni 3178  df-int 3215
Copyright terms: Public domain