Theorem reliin 5806

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 5023	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝐵 ⊆ (V × V) → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
2		df-rel 5670	. . 3 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V))
3	2	rexbii 3114	. 2 ⊢ (∃𝑥 ∈ 𝐴 Rel 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
4		df-rel 5670	. 2 ⊢ (Rel ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
5	1, 3, 4	3imtr4i 295	1 ⊢ (∃𝑥 ∈ 𝐴 Rel 𝐵 → Rel ∩ 𝑥 ∈ 𝐴 𝐵)

This proof depends on syntax axioms:   → wi 4  ∃wrex 3091  Vcvv 3457   ⊆ wss 3906  ∩ ciin 4959   × cxp 5661  Rel wrel 5668

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 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-v 3459  df-ss 3923  df-iin 4961  df-rel 5670

This theorem is used by:  relint  5808  xpiindi  5823  dibglbN  42000  dihglbcpreN  42134  iinxp  49668