MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  intprg Structured version   Visualization version   GIF version

Theorem intprg 4944
Description: The intersection of a pair is the intersection of its members. Closed form of intpr 4945. Theorem 71 of [Suppes] p. 42. (Contributed by FL, 27-Apr-2008.) (Proof shortened by BJ, 1-Sep-2024.)
Assertion
Ref Expression
intprg ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵))

Proof of Theorem intprg
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3458 . . . . 5 𝑥 ∈ V
21elint 4916 . . . 4 (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ ∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦))
3 vex 3458 . . . . . . . 8 𝑦 ∈ V
43elpr 4609 . . . . . . 7 (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴 ∨ 𝑦 = 𝐵))
54imbi1i 352 . . . . . 6 ((𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦))
6 jaob 976 . . . . . 6 (((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
75, 6bitri 278 . . . . 5 ((𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
87albii 1852 . . . 4 (∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ∀𝑦((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
9 19.26 1903 . . . 4 (∀𝑦((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)) ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
102, 8, 93bitri 300 . . 3 (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
11 elin 4096 . . . 4 (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
12 clel4g 3620 . . . . 5 (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↔ ∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦)))
13 clel4g 3620 . . . . 5 (𝐵 ∈ 𝑊 → (𝑥 ∈ 𝐵 ↔ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
1412, 13bi2anan9 650 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦))))
1511, 14bitr2id 287 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)) ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
1610, 15bitrid 286 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
1716eqrdv 2761 1 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861  ∀wal 1568   = wceq 1570   ∈ wcel 2147   ∩ cin 4092  {cpr 4590  ∩ cint 4910
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-in 4094  df-un 4154  df-sn 4589  df-pr 4591  df-int 4911
This theorem is used by:  intpr  4945  intsng  4946  inelfi  9437  mreincl  17798  subrngin  20843  subrgin  20878  lssincl  21270  incld  23391  inlidl  34041  inelpisys  34857  bj-prmoore  38227  inidl  39156  toplatmeet  50322
  Copyright terms: Public domain W3C validator