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

Theorem intpr 1990
Description: The intersection of a pair is the intersection of its members. Theorem 71 of [Suppes] p. 42.
Hypotheses
Ref Expression
intpr.1 AV
intpr.2 BV
Assertion
Ref Expression
intpr {A, B} = (AB)

Proof of Theorem intpr
StepHypRef Expression
1 19.26 749 . . . 4 (∀y((y = Axy) ∧ (y = Bxy)) ↔ (∀y(y = Axy) ∧ ∀y(y = Bxy)))
2 visset 1350 . . . . . . . 8 yV
32elpr 1823 . . . . . . 7 (y ∈ {A, B} ↔ (y = Ay = B))
43imbi1i 161 . . . . . 6 ((y ∈ {A, B} → xy) ↔ ((y = Ay = B) → xy))
5 jaob 328 . . . . . 6 (((y = Ay = B) → xy) ↔ ((y = Axy) ∧ (y = Bxy)))
64, 5bitr 151 . . . . 5 ((y ∈ {A, B} → xy) ↔ ((y = Axy) ∧ (y = Bxy)))
76bial 695 . . . 4 (∀y(y ∈ {A, B} → xy) ↔ ∀y((y = Axy) ∧ (y = Bxy)))
8 intpr.1 . . . . . 6 AV
98clel4 1376 . . . . 5 (xA ↔ ∀y(y = Axy))
10 intpr.2 . . . . . 6 BV
1110clel4 1376 . . . . 5 (xB ↔ ∀y(y = Bxy))
129, 11anbi12i 369 . . . 4 ((xAxB) ↔ (∀y(y = Axy) ∧ ∀y(y = Bxy)))
131, 7, 123bitr4 158 . . 3 (∀y(y ∈ {A, B} → xy) ↔ (xAxB))
14 visset 1350 . . . 4 xV
1514elint 1971 . . 3 (x{A, B} ↔ ∀y(y ∈ {A, B} → xy))
16 elin 1635 . . 3 (x ∈ (AB) ↔ (xAxB))
1713, 15, 163bitr4 158 . 2 (x{A, B} ↔ x ∈ (AB))
1817cleqri 1101 1 {A, B} = (AB)
Colors of variables: wff set class
Syntax hints:   → wi 2   ∨ wo 195   ∧ wa 196  ∀wal 672   ∈ wel 803   = wceq 1091   ∈ wcel 1092  Vcvv 1348   ∩ cin 1486  {cpr 1809  cint 1965
This theorem is referenced by:  intsn 1991  op1stb 1992  fiint 3445  shincl 5332  chincl 5382
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-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-un 1490  df-in 1491  df-sn 1811  df-pr 1812  df-int 1966
metamath.org