Theorem reliin 5766

Description: An indexed intersection is a relation if at least one of the member of the indexed family is a relation. (Contributed by NM, 8-Mar-2014.)

Assertion

Ref	Expression
reliin	⊢ (∃𝑥 ∈ 𝐴 Rel 𝐵 → Rel ∩ 𝑥 ∈ 𝐴 𝐵)

Proof of Theorem reliin

Step	Hyp	Ref	Expression
1		iinss 5011	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 ⊆ (V × V) → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
2		df-rel 5634	. . 3 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V))
3	2	rexbii 3095	. 2 ⊢ (∃𝑥 ∈ 𝐴 Rel 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
4		df-rel 5634	. 2 ⊢ (Rel ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
5	1, 3, 4	3imtr4i 292	1 ⊢ (∃𝑥 ∈ 𝐴 Rel 𝐵 → Rel ∩ 𝑥 ∈ 𝐴 𝐵)

Syntax hints:   → wi 4  ∃wrex 3071  Vcvv 3443   ⊆ wss 3905  ∩ ciin 4950   × cxp 5625  Rel wrel 5632

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2708

This theorem depends on definitions:  df-bi 206  df-an 398  df-tru 1544  df-ex 1782  df-sb 2068  df-clab 2715  df-cleq 2729  df-clel 2815  df-ral 3063  df-rex 3072  df-v 3445  df-in 3912  df-ss 3922  df-iin 4952  df-rel 5634

This theorem is referenced by:  relint  5768  xpiindi  5784  dibglbN  39485  dihglbcpreN  39619