Theorem cnvprop 32677

Description: Converse of a pair of ordered pairs. (Contributed by Thierry Arnoux, 24-Sep-2023.)

Assertion

Ref	Expression
cnvprop	⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ◡{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = {⟨𝐵, 𝐴⟩, ⟨𝐷, 𝐶⟩})

Proof of Theorem cnvprop

Step	Hyp	Ref	Expression
1		cnvsng 6170	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
2	1	adantr 480	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
3		cnvsng 6170	. . . 4 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → ◡{⟨𝐶, 𝐷⟩} = {⟨𝐷, 𝐶⟩})
4	3	adantl 481	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ◡{⟨𝐶, 𝐷⟩} = {⟨𝐷, 𝐶⟩})
5	2, 4	uneq12d 4116	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (◡{⟨𝐴, 𝐵⟩} ∪ ◡{⟨𝐶, 𝐷⟩}) = ({⟨𝐵, 𝐴⟩} ∪ {⟨𝐷, 𝐶⟩}))
6		df-pr 4576	. . . 4 ⊢ {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩})
7	6	cnveqi 5813	. . 3 ⊢ ◡{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = ◡({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩})
8		cnvun 6089	. . 3 ⊢ ◡({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩}) = (◡{⟨𝐴, 𝐵⟩} ∪ ◡{⟨𝐶, 𝐷⟩})
9	7, 8	eqtri 2754	. 2 ⊢ ◡{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = (◡{⟨𝐴, 𝐵⟩} ∪ ◡{⟨𝐶, 𝐷⟩})
10		df-pr 4576	. 2 ⊢ {⟨𝐵, 𝐴⟩, ⟨𝐷, 𝐶⟩} = ({⟨𝐵, 𝐴⟩} ∪ {⟨𝐷, 𝐶⟩})
11	5, 9, 10	3eqtr4g 2791	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ◡{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = {⟨𝐵, 𝐴⟩, ⟨𝐷, 𝐶⟩})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2111   ∪ cun 3895  {csn 4573  {cpr 4575  ⟨cop 4579  ^◡ccnv 5613

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-br 5090  df-opab 5152  df-xp 5620  df-rel 5621  df-cnv 5622

This theorem is referenced by:  cycpm2tr  33088