Theorem dmin 5895

Description: The domain of an intersection is included in the intersection of the domains. Theorem 6 of [Suppes] p. 60. (Contributed by NM, 15-Sep-2004.)

Assertion

Ref	Expression
dmin	⊢ dom (𝐴 ∩ 𝐵) ⊆ (dom 𝐴 ∩ dom 𝐵)

Proof of Theorem dmin

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		19.40 1919	. . 3 ⊢ (∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵) → (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵))
2		vex 3454	. . . . 5 ⊢ 𝑥 ∈ V
3	2	eldm2 5885	. . . 4 ⊢ (𝑥 ∈ dom (𝐴 ∩ 𝐵) ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ (𝐴 ∩ 𝐵))
4		elin 3915	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 ∩ 𝐵) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
5	4	exbii 1881	. . . 4 ⊢ (∃𝑦⟨𝑥, 𝑦⟩ ∈ (𝐴 ∩ 𝐵) ↔ ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
6	3, 5	bitri 278	. . 3 ⊢ (𝑥 ∈ dom (𝐴 ∩ 𝐵) ↔ ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
7		elin 3915	. . . 4 ⊢ (𝑥 ∈ (dom 𝐴 ∩ dom 𝐵) ↔ (𝑥 ∈ dom 𝐴 ∧ 𝑥 ∈ dom 𝐵))
8	2	eldm2 5885	. . . . 5 ⊢ (𝑥 ∈ dom 𝐴 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴)
9	2	eldm2 5885	. . . . 5 ⊢ (𝑥 ∈ dom 𝐵 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵)
10	8, 9	anbi12i 640	. . . 4 ⊢ ((𝑥 ∈ dom 𝐴 ∧ 𝑥 ∈ dom 𝐵) ↔ (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵))
11	7, 10	bitri 278	. . 3 ⊢ (𝑥 ∈ (dom 𝐴 ∩ dom 𝐵) ↔ (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴 ∧ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐵))
12	1, 6, 11	3imtr4i 295	. 2 ⊢ (𝑥 ∈ dom (𝐴 ∩ 𝐵) → 𝑥 ∈ (dom 𝐴 ∩ dom 𝐵))
13	12	ssriv 3935	1 ⊢ dom (𝐴 ∩ 𝐵) ⊆ (dom 𝐴 ∩ dom 𝐵)

This proof depends on syntax axioms:   ∧ wa 401  ∃wex 1812   ∈ wcel 2145   ∩ cin 3898   ⊆ wss 3899  ⟨cop 4590  dom cdm 5655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-dm 5665

This theorem is used by:  rninOLD  6138  psssdm2  18669  hauseqcn  34408