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

Theorem reliun 5803
Description: An indexed union is a relation iff each member of its indexed family is a relation. (Contributed by NM, 19-Dec-2008.) (Proof shortened by SN, 2-Feb-2025.)
Assertion
Ref Expression
reliun (Rel ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 Rel 𝐵)

Proof of Theorem reliun
StepHypRef Expression
1 iunss 5008 . 2 (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V) ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
2 df-rel 5665 . 2 (Rel ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
3 df-rel 5665 . . 3 (Rel 𝐵 ↔ 𝐵 ⊆ (V × V))
43ralbii 3112 . 2 (∀𝑥 ∈ 𝐴 Rel 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
51, 2, 43bitr4i 306 1 (Rel ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 Rel 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209  ∀wral 3080  Vcvv 3454   ⊆ wss 3900  ∪ ciun 4956   × 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-11 2197  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-iun 4958  df-rel 5665
This theorem is used by:  reluni  5805  eliunxp  5824  opeliunxp2  5825  dfco2  6265  coiun  6277  fvn0ssdmfun  7106  opeliunxp2f  8265  fsumcom2  15984  fprodcom2  16195  imasaddfnlem  17750  imasvscafn  17759  gsum2d2lem  20238  gsum2d2  20239  gsumcom2  20240  dprd2d2  20311  cnextrel  24437  reldv  26245  dfcnv2  33366  gsumpart  33723  gsumwrd2dccat  33738  cvmliftlem1  36258  cnviun  44972  coiun1  44974  eliunxp2  49838
  Copyright terms: Public domain W3C validator