Theorem intprg 4912

Description: The intersection of a pair is the intersection of its members. Closed form of intpr 4913. 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.

Step	Hyp	Ref	Expression
1		vex 3436	. . . . . 6 ⊢ 𝑥 ∈ V
2	1	elint 4885	. . . . 5 ⊢ (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ ∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦))
3		vex 3436	. . . . . . . . 9 ⊢ 𝑦 ∈ V
4	3	elpr 4584	. . . . . . . 8 ⊢ (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴 ∨ 𝑦 = 𝐵))
5	4	imbi1i 350	. . . . . . 7 ⊢ ((𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦))
6		jaob 959	. . . . . . 7 ⊢ (((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
7	5, 6	bitri 274	. . . . . 6 ⊢ ((𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
8	7	albii 1822	. . . . 5 ⊢ (∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ∀𝑦((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
9		19.26 1873	. . . . 5 ⊢ (∀𝑦((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)) ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
10	2, 8, 9	3bitri 297	. . . 4 ⊢ (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
11		elin 3903	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
12		clel4g 3593	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↔ ∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦)))
13		clel4g 3593	. . . . . 6 ⊢ (𝐵 ∈ 𝑊 → (𝑥 ∈ 𝐵 ↔ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
14	12, 13	bi2anan9 636	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦))))
15	11, 14	bitr2id 284	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)) ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
16	10, 15	bitrid 282	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
17	16	alrimiv 1930	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∀𝑥(𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
18		dfcleq 2731	. 2 ⊢ (∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵) ↔ ∀𝑥(𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
19	17, 18	sylibr 233	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 844  ∀wal 1537   = wceq 1539   ∈ wcel 2106   ∩ cin 3886  {cpr 4563  ∩ cint 4879

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-v 3434  df-un 3892  df-in 3894  df-sn 4562  df-pr 4564  df-int 4880

This theorem is referenced by:  intpr  4913  intsng  4916  inelfi  9177  mreincl  17308  subrgin  20047  lssincl  20227  incld  22194  difelsiga  32101  inelpisys  32122  bj-prmoore  35286  inidl  36188  toplatmeet  46289