Theorem intprg 5005

Description: The intersection of a pair is the intersection of its members. Closed form of intpr 5006. 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 3492	. . . . . 6 ⊢ 𝑥 ∈ V
2	1	elint 4976	. . . . 5 ⊢ (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ ∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦))
3		vex 3492	. . . . . . . . 9 ⊢ 𝑦 ∈ V
4	3	elpr 4672	. . . . . . . 8 ⊢ (𝑦 ∈ {𝐴, 𝐵} ↔ (𝑦 = 𝐴 ∨ 𝑦 = 𝐵))
5	4	imbi1i 349	. . . . . . 7 ⊢ ((𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦))
6		jaob 962	. . . . . . 7 ⊢ (((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
7	5, 6	bitri 275	. . . . . 6 ⊢ ((𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
8	7	albii 1817	. . . . 5 ⊢ (∀𝑦(𝑦 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑦) ↔ ∀𝑦((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
9		19.26 1869	. . . . 5 ⊢ (∀𝑦((𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ (𝑦 = 𝐵 → 𝑥 ∈ 𝑦)) ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
10	2, 8, 9	3bitri 297	. . . 4 ⊢ (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
11		elin 3992	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
12		clel4g 3676	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↔ ∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦)))
13		clel4g 3676	. . . . . 6 ⊢ (𝐵 ∈ 𝑊 → (𝑥 ∈ 𝐵 ↔ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)))
14	12, 13	bi2anan9 637	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦))))
15	11, 14	bitr2id 284	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((∀𝑦(𝑦 = 𝐴 → 𝑥 ∈ 𝑦) ∧ ∀𝑦(𝑦 = 𝐵 → 𝑥 ∈ 𝑦)) ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
16	10, 15	bitrid 283	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
17	16	alrimiv 1926	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∀𝑥(𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
18		dfcleq 2733	. 2 ⊢ (∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵) ↔ ∀𝑥(𝑥 ∈ ∩ {𝐴, 𝐵} ↔ 𝑥 ∈ (𝐴 ∩ 𝐵)))
19	17, 18	sylibr 234	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 846  ∀wal 1535   = wceq 1537   ∈ wcel 2108   ∩ cin 3975  {cpr 4650  ∩ cint 4970

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-v 3490  df-un 3981  df-in 3983  df-sn 4649  df-pr 4651  df-int 4971

This theorem is referenced by:  intpr  5006  intsng  5007  inelfi  9487  mreincl  17657  subrngin  20587  subrgin  20624  lssincl  20986  incld  23072  difelsiga  34097  inelpisys  34118  bj-prmoore  37081  inidl  37990  toplatmeet  48675