MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  reliin Structured version   Visualization version   GIF version

Theorem reliin 5804
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
StepHypRef Expression
1 iinss 5020 . 2 (∃𝑥 ∈ 𝐴 𝐵 ⊆ (V × V) → ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
2 df-rel 5665 . . 3 (Rel 𝐵 ↔ 𝐵 ⊆ (V × V))
32rexbii 3113 . 2 (∃𝑥 ∈ 𝐴 Rel 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
4 df-rel 5665 . 2 (Rel ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∩ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
51, 3, 43imtr4i 295 1 (∃𝑥 ∈ 𝐴 Rel 𝐵 → Rel ∩ 𝑥 ∈ 𝐴 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  ∩ ciin 4957   × cxp 5656  Rel wrel 5663
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-iin 4959  df-rel 5665
This theorem is used by:  relint  5806  xpiindi  5822  dibglbN  42489  dihglbcpreN  42623  iinxp  50273
  Copyright terms: Public domain W3C validator