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

Theorem intprg 4929
Description: The intersection of a pair is the intersection of its members. Closed form of intpr 4930. 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 3448 . . . . 5 𝑥 ∈ V
21elint 4901 . . . 4 (𝑥 {𝐴, 𝐵} ↔ ∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥𝑦))
3 vex 3448 . . . . . . . 8 𝑦 ∈ V
43elpr 4597 . . . . . . 7 (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴𝑦 = 𝐵))
54imbi1i 351 . . . . . 6 ((𝑦 ∈ {𝐴, 𝐵} → 𝑥𝑦) ↔ ((𝑦 = 𝐴𝑦 = 𝐵) → 𝑥𝑦))
6 jaob 972 . . . . . 6 (((𝑦 = 𝐴𝑦 = 𝐵) → 𝑥𝑦) ↔ ((𝑦 = 𝐴𝑥𝑦) ∧ (𝑦 = 𝐵𝑥𝑦)))
75, 6bitri 277 . . . . 5 ((𝑦 ∈ {𝐴, 𝐵} → 𝑥𝑦) ↔ ((𝑦 = 𝐴𝑥𝑦) ∧ (𝑦 = 𝐵𝑥𝑦)))
87albii 1829 . . . 4 (∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥𝑦) ↔ ∀𝑦((𝑦 = 𝐴𝑥𝑦) ∧ (𝑦 = 𝐵𝑥𝑦)))
9 19.26 1880 . . . 4 (∀𝑦((𝑦 = 𝐴𝑥𝑦) ∧ (𝑦 = 𝐵𝑥𝑦)) ↔ (∀𝑦(𝑦 = 𝐴𝑥𝑦) ∧ ∀𝑦(𝑦 = 𝐵𝑥𝑦)))
102, 8, 93bitri 299 . . 3 (𝑥 {𝐴, 𝐵} ↔ (∀𝑦(𝑦 = 𝐴𝑥𝑦) ∧ ∀𝑦(𝑦 = 𝐵𝑥𝑦)))
11 elin 3911 . . . 4 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
12 clel4g 3613 . . . . 5 (𝐴𝑉 → (𝑥𝐴 ↔ ∀𝑦(𝑦 = 𝐴𝑥𝑦)))
13 clel4g 3613 . . . . 5 (𝐵𝑊 → (𝑥𝐵 ↔ ∀𝑦(𝑦 = 𝐵𝑥𝑦)))
1412, 13bi2anan9 646 . . . 4 ((𝐴𝑉𝐵𝑊) → ((𝑥𝐴𝑥𝐵) ↔ (∀𝑦(𝑦 = 𝐴𝑥𝑦) ∧ ∀𝑦(𝑦 = 𝐵𝑥𝑦))))
1511, 14bitr2id 286 . . 3 ((𝐴𝑉𝐵𝑊) → ((∀𝑦(𝑦 = 𝐴𝑥𝑦) ∧ ∀𝑦(𝑦 = 𝐵𝑥𝑦)) ↔ 𝑥 ∈ (𝐴𝐵)))
1610, 15bitrid 285 . 2 ((𝐴𝑉𝐵𝑊) → (𝑥 {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴𝐵)))
1716eqrdv 2750 1 ((𝐴𝑉𝐵𝑊) → {𝐴, 𝐵} = (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  wo 856  wal 1548   = wceq 1550  wcel 2132  cin 3894  {cpr 4574   cint 4895
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-ext 2724
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-tru 1553  df-ex 1790  df-sb 2081  df-clab 2731  df-cleq 2744  df-clel 2827  df-v 3446  df-un 3900  df-in 3902  df-sn 4573  df-pr 4575  df-int 4896
This theorem is referenced by:  intpr  4930  intsng  4931  inelfi  9350  mreincl  17599  subrngin  20579  subrgin  20614  lssincl  21001  incld  23072  difelsiga  34374  inelpisys  34395  bj-prmoore  37543  inidl  38467  toplatmeet  49562
  Copyright terms: Public domain W3C validator