Theorem relcnvfld 6302

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 6296	. 2 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅))
2		unidmrn 6301	. 2 ⊢ ∪ ∪ ◡𝑅 = (dom 𝑅 ∪ ran 𝑅)
3	1, 2	eqtr4di 2816	1 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = ∪ ∪ ◡𝑅)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∪ cun 4152  ∪ cuni 4870  ^◡ccnv 5655  dom cdm 5656  ran crn 5657  Rel wrel 5661

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  ax-sep 5253  ax-pr 5396

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-xp 5662  df-rel 5663  df-cnv 5664  df-dm 5666  df-rn 5667

This theorem is used by:  cnvps  18784  tsrdir  18810