Theorem fiinfi 44332

Description: If two classes have the finite intersection property, then so does their intersection. (Contributed by RP, 1-Jan-2020.)

Hypotheses

Ref	Expression
fiinfi.a	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ∩ 𝑦) ∈ 𝐴)
fiinfi.b	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ∈ 𝐵)
fiinfi.c	⊢ (𝜑 → 𝐶 = (𝐴 ∩ 𝐵))

Assertion

Ref	Expression
fiinfi	⊢ (𝜑 → ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 (𝑥 ∩ 𝑦) ∈ 𝐶)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝜑,𝑥,𝑦

Proof of Theorem fiinfi

Step	Hyp	Ref	Expression
1		fiinfi.a	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ∩ 𝑦) ∈ 𝐴)
2		elinel1 4157	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) → 𝑥 ∈ 𝐴)
3		elinel1 4157	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝐴 ∩ 𝐵) → 𝑦 ∈ 𝐴)
4	3	imim1i 64	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐴 → (𝑥 ∩ 𝑦) ∈ 𝐴) → (𝑦 ∈ (𝐴 ∩ 𝐵) → (𝑥 ∩ 𝑦) ∈ 𝐴))
5	4	ralimi2 3100	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐴 (𝑥 ∩ 𝑦) ∈ 𝐴 → ∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐴)
6	2, 5	imim12i 63	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 (𝑥 ∩ 𝑦) ∈ 𝐴) → (𝑥 ∈ (𝐴 ∩ 𝐵) → ∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐴))
7	6	ralimi2 3100	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ∩ 𝑦) ∈ 𝐴 → ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐴)
8	1, 7	syl 18	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐴)
9		fiinfi.b	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ∈ 𝐵)
10		elinel2 4158	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) → 𝑥 ∈ 𝐵)
11		elinel2 4158	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝐴 ∩ 𝐵) → 𝑦 ∈ 𝐵)
12	11	imim1i 64	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐵 → (𝑥 ∩ 𝑦) ∈ 𝐵) → (𝑦 ∈ (𝐴 ∩ 𝐵) → (𝑥 ∩ 𝑦) ∈ 𝐵))
13	12	ralimi2 3100	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ∈ 𝐵 → ∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐵)
14	10, 13	imim12i 63	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 → ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ∈ 𝐵) → (𝑥 ∈ (𝐴 ∩ 𝐵) → ∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐵))
15	14	ralimi2 3100	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ∈ 𝐵 → ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐵)
16	9, 15	syl 18	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐵)
17		r19.26-2 3153	. . . . . 6 ⊢ (∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)((𝑥 ∩ 𝑦) ∈ 𝐴 ∧ (𝑥 ∩ 𝑦) ∈ 𝐵) ↔ (∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐴 ∧ ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐵))
18	8, 16, 17	sylanbrc 595	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)((𝑥 ∩ 𝑦) ∈ 𝐴 ∧ (𝑥 ∩ 𝑦) ∈ 𝐵))
19		elin 3924	. . . . . 6 ⊢ ((𝑥 ∩ 𝑦) ∈ (𝐴 ∩ 𝐵) ↔ ((𝑥 ∩ 𝑦) ∈ 𝐴 ∧ (𝑥 ∩ 𝑦) ∈ 𝐵))
20	19	2ralbii 3143	. . . . 5 ⊢ (∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ (𝐴 ∩ 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)((𝑥 ∩ 𝑦) ∈ 𝐴 ∧ (𝑥 ∩ 𝑦) ∈ 𝐵))
21	18, 20	sylibr 237	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ (𝐴 ∩ 𝐵))
22		fiinfi.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 = (𝐴 ∩ 𝐵))
23	22	eleq2d 2852	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∩ 𝑦) ∈ 𝐶 ↔ (𝑥 ∩ 𝑦) ∈ (𝐴 ∩ 𝐵)))
24	23	ralbidv 3191	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐶 ↔ ∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ (𝐴 ∩ 𝐵)))
25	24	ralbidv 3191	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐶 ↔ ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ (𝐴 ∩ 𝐵)))
26	21, 25	mpbird 260	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐶)
27	22	raleqdv 3326	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐶 (𝑥 ∩ 𝑦) ∈ 𝐶 ↔ ∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐶))
28	27	ralbidv 3191	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ 𝐶 (𝑥 ∩ 𝑦) ∈ 𝐶 ↔ ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ (𝐴 ∩ 𝐵)(𝑥 ∩ 𝑦) ∈ 𝐶))
29	26, 28	mpbird 260	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ 𝐶 (𝑥 ∩ 𝑦) ∈ 𝐶)
30	22	raleqdv 3326	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 (𝑥 ∩ 𝑦) ∈ 𝐶 ↔ ∀𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑦 ∈ 𝐶 (𝑥 ∩ 𝑦) ∈ 𝐶))
31	29, 30	mpbird 260	1 ⊢ (𝜑 → ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 (𝑥 ∩ 𝑦) ∈ 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3082   ∩ cin 3907

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 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-v 3460  df-in 3915

This theorem is used by: (None)