Theorem reliun 5791

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

Step	Hyp	Ref	Expression
1		iunss 5004	. 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V) ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
2		df-rel 5656	. 2 ⊢ (Rel ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
3		df-rel 5656	. . 3 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V))
4	3	ralbii 3110	. 2 ⊢ (∀𝑥 ∈ 𝐴 Rel 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ (V × V))
5	1, 2, 4	3bitr4i 305	1 ⊢ (Rel ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 Rel 𝐵)

Syntax hints:   ↔ wb 208  ∀wral 3078  Vcvv 3456   ⊆ wss 3906  ∪ ciun 4951   × cxp 5647  Rel wrel 5654

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-11 2193  ax-ext 2736

This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1565  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ral 3079  df-rex 3089  df-v 3458  df-ss 3923  df-iun 4953  df-rel 5656

This theorem is referenced by:  reluni  5793  eliunxp  5811  opeliunxp2  5812  dfco2  6234  coiun  6246  fvn0ssdmfun  7057  opeliunxp2f  8192  fsumcom2  15803  fprodcom2  16016  imasaddfnlem  17560  imasvscafn  17569  gsum2d2lem  20015  gsum2d2  20016  gsumcom2  20017  dprd2d2  20088  cnextrel  24125  reldv  25934  dfcnv2  32879  gsumpart  33245  gsumwrd2dccat  33260  cvmliftlem1  35640  cnviun  44231  coiun1  44233  eliunxp2  48961