Theorem fipjust 42995

Description: A definition of the finite intersection property of a class based on closure under pairwise intersection of its elements is independent of the dummy variables. (Contributed by RP, 1-Jan-2020.)

Assertion

Ref	Expression
fipjust	⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 ∩ 𝑣) ∈ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ∩ 𝑦) ∈ 𝐴)

Distinct variable group:   𝑣,𝑢,𝑥,𝑦,𝐴

Proof of Theorem fipjust

Step	Hyp	Ref	Expression
1		ineq1 4205	. . 3 ⊢ (𝑢 = 𝑥 → (𝑢 ∩ 𝑣) = (𝑥 ∩ 𝑣))
2	1	eleq1d 2814	. 2 ⊢ (𝑢 = 𝑥 → ((𝑢 ∩ 𝑣) ∈ 𝐴 ↔ (𝑥 ∩ 𝑣) ∈ 𝐴))
3		ineq2 4206	. . 3 ⊢ (𝑣 = 𝑦 → (𝑥 ∩ 𝑣) = (𝑥 ∩ 𝑦))
4	3	eleq1d 2814	. 2 ⊢ (𝑣 = 𝑦 → ((𝑥 ∩ 𝑣) ∈ 𝐴 ↔ (𝑥 ∩ 𝑦) ∈ 𝐴))
5	2, 4	cbvral2vw 3235	1 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 ∩ 𝑣) ∈ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ∩ 𝑦) ∈ 𝐴)

Syntax hints:   ↔ wb 205   ∈ wcel 2099  ∀wral 3058   ∩ cin 3946

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2699

This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1537  df-ex 1775  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-ral 3059  df-rab 3430  df-in 3954

This theorem is referenced by: (None)