Theorem intprg 4981

Description: The intersection of a pair is the intersection of its members. Closed form of intpr 4982. 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 3484	. . . . . 6 ⊢ 𝑥 ∈ V
2	1	elint 4952	. . . . 5 ⊢ (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ ∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦))
3		vex 3484	. . . . . . . . 9 ⊢ 𝑦 ∈ V
4	3	elpr 4650	. . . . . . . 8 ⊢ (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴 ∨ 𝑦 = 𝐵))
5	4	imbi1i 349	. . . . . . 7 ⊢ ((𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦))
6		jaob 964	. . . . . . 7 ⊢ (((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
7	5, 6	bitri 275	. . . . . 6 ⊢ ((𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
8	7	albii 1819	. . . . 5 ⊢ (∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ∀𝑦((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
9		19.26 1870	. . . . 5 ⊢ (∀𝑦((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)) ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
10	2, 8, 9	3bitri 297	. . . 4 ⊢ (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
11		elin 3967	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
12		clel4g 3663	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↔ ∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦)))
13		clel4g 3663	. . . . . 6 ⊢ (𝐵 ∈ 𝑊 → (𝑥 ∈ 𝐵 ↔ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
14	12, 13	bi2anan9 638	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦))))
15	11, 14	bitr2id 284	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)) ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
16	10, 15	bitrid 283	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
17	16	alrimiv 1927	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∀𝑥(𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
18		dfcleq 2730	. 2 ⊢ (∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵) ↔ ∀𝑥(𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
19	17, 18	sylibr 234	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848  ∀wal 1538   = wceq 1540   ∈ wcel 2108   ∩ cin 3950  {cpr 4628  ∩ cint 4946

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1543  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-v 3482  df-un 3956  df-in 3958  df-sn 4627  df-pr 4629  df-int 4947

This theorem is referenced by:  intpr  4982  intsng  4983  inelfi  9458  mreincl  17642  subrngin  20561  subrgin  20596  lssincl  20963  incld  23051  difelsiga  34134  inelpisys  34155  bj-prmoore  37116  inidl  38037  toplatmeet  48892