Theorem relcnvfld 6283

Description: if 𝑅 is a relation, its double union equals the double union of its converse. (Contributed by FL, 5-Jan-2009.)

Assertion

Ref	Expression
relcnvfld	⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = ∪ ∪ ◡𝑅)

Proof of Theorem relcnvfld

Step	Hyp	Ref	Expression
1		relfld 6277	. 2 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅))
2		unidmrn 6282	. 2 ⊢ ∪ ∪ ◡𝑅 = (dom 𝑅 ∪ ran 𝑅)
3	1, 2	eqtr4di 2813	1 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = ∪ ∪ ◡𝑅)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∪ cun 4149  ∪ cuni 4866  ^◡ccnv 5649  dom cdm 5650  ran crn 5651  Rel wrel 5655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-dm 5660  df-rn 5661

This theorem is used by:  cnvps  18757  tsrdir  18783