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

Theorem intprg 4911
Description: The intersection of a pair is the intersection of its members. Closed form of intpr 4912. 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 3435 . . . . 5 𝑥 ∈ V
21elint 4883 . . . 4 (𝑥 {𝐴, 𝐵} ↔ ∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥𝑦))
3 vex 3435 . . . . . . . 8 𝑦 ∈ V
43elpr 4580 . . . . . . 7 (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴𝑦 = 𝐵))
54imbi1i 350 . . . . . 6 ((𝑦 ∈ {𝐴, 𝐵} → 𝑥𝑦) ↔ ((𝑦 = 𝐴𝑦 = 𝐵) → 𝑥𝑦))
6 jaob 969 . . . . . 6 (((𝑦 = 𝐴𝑦 = 𝐵) → 𝑥𝑦) ↔ ((𝑦 = 𝐴𝑥𝑦) ∧ (𝑦 = 𝐵𝑥𝑦)))
75, 6bitri 276 . . . . 5 ((𝑦 ∈ {𝐴, 𝐵} → 𝑥𝑦) ↔ ((𝑦 = 𝐴𝑥𝑦) ∧ (𝑦 = 𝐵𝑥𝑦)))
87albii 1826 . . . 4 (∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥𝑦) ↔ ∀𝑦((𝑦 = 𝐴𝑥𝑦) ∧ (𝑦 = 𝐵𝑥𝑦)))
9 19.26 1877 . . . 4 (∀𝑦((𝑦 = 𝐴𝑥𝑦) ∧ (𝑦 = 𝐵𝑥𝑦)) ↔ (∀𝑦(𝑦 = 𝐴𝑥𝑦) ∧ ∀𝑦(𝑦 = 𝐵𝑥𝑦)))
102, 8, 93bitri 298 . . 3 (𝑥 {𝐴, 𝐵} ↔ (∀𝑦(𝑦 = 𝐴𝑥𝑦) ∧ ∀𝑦(𝑦 = 𝐵𝑥𝑦)))
11 elin 3899 . . . 4 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
12 clel4g 3601 . . . . 5 (𝐴𝑉 → (𝑥𝐴 ↔ ∀𝑦(𝑦 = 𝐴𝑥𝑦)))
13 clel4g 3601 . . . . 5 (𝐵𝑊 → (𝑥𝐵 ↔ ∀𝑦(𝑦 = 𝐵𝑥𝑦)))
1412, 13bi2anan9 644 . . . 4 ((𝐴𝑉𝐵𝑊) → ((𝑥𝐴𝑥𝐵) ↔ (∀𝑦(𝑦 = 𝐴𝑥𝑦) ∧ ∀𝑦(𝑦 = 𝐵𝑥𝑦))))
1511, 14bitr2id 285 . . 3 ((𝐴𝑉𝐵𝑊) → ((∀𝑦(𝑦 = 𝐴𝑥𝑦) ∧ ∀𝑦(𝑦 = 𝐵𝑥𝑦)) ↔ 𝑥 ∈ (𝐴𝐵)))
1610, 15bitrid 284 . 2 ((𝐴𝑉𝐵𝑊) → (𝑥 {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴𝐵)))
1716eqrdv 2737 1 ((𝐴𝑉𝐵𝑊) → {𝐴, 𝐵} = (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wo 853  wal 1545   = wceq 1547  wcel 2119  cin 3882  {cpr 4557   cint 4877
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-v 3433  df-un 3888  df-in 3890  df-sn 4556  df-pr 4558  df-int 4878
This theorem is referenced by:  intpr  4912  intsng  4913  inelfi  9321  mreincl  17552  subrngin  20533  subrgin  20568  lssincl  20955  incld  23026  difelsiga  34317  inelpisys  34338  bj-prmoore  37473  inidl  38397  toplatmeet  49493
  Copyright terms: Public domain W3C validator