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

Theorem intss 1983
Description: Intersection of subclasses.
Assertion
Ref Expression
intss |- (A (_ B -> |^|B (_ |^|A)

Proof of Theorem intss
StepHypRef Expression
1 syl2 17 . . . . 5 |- ((y e. A -> y e. B) -> ((y e. B -> x e. y) -> (y e. A -> x e. y)))
2119.20ii 692 . . . 4 |- (A.y(y e. A -> y e. B) -> (A.y(y e. B -> x e. y) -> A.y(y e. A -> x e. y)))
3 visset 1350 . . . . 5 |- x e. V
43elint 1971 . . . 4 |- (x e. |^|B <-> A.y(y e. B -> x e. y))
53elint 1971 . . . 4 |- (x e. |^|A <-> A.y(y e. A -> x e. y))
62, 4, 53imtr4g 426 . . 3 |- (A.y(y e. A -> y e. B) -> (x e. |^|B -> x e. |^|A))
7619.21aiv 943 . 2 |- (A.y(y e. A -> y e. B) -> A.x(x e. |^|B -> x e. |^|A))
8 dfss2 1497 . 2 |- (A (_ B <-> A.y(y e. A -> y e. B))
9 dfss2 1497 . 2 |- (|^|B (_ |^|A <-> A.x(x e. |^|B -> x e. |^|A))
107, 8, 93imtr4 192 1 |- (A (_ B -> |^|B (_ |^|A)
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672   e. wel 803   e. wcel 1092   (_ wss 1487  |^|cint 1965
This theorem is referenced by:  rankval3 3525  rankr1id 3539  ranklon 3540  cfub 3703  cflim 3704  cflecard 3707  cfom 3710  hsupss 5310  spanss 5319
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-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-in 1491  df-ss 1492  df-int 1966
metamath.org