opswap - Metamath Proof Explorer

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

Theorem opswap 6176

Description: Swap the members of an ordered pair. (Contributed by NM, 14-Dec-2008.) (Revised by Mario Carneiro, 30-Aug-2015.)

**Assertion**
Ref	Expression
opswap	⊢ ∪ ^◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩

**Proof of Theorem opswap**
Step	Hyp	Ref	Expression
1		cnvsng 6170	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ^◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
2	1	unieqd 4869	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ ^◡{⟨𝐴, 𝐵⟩} = ∪ {⟨𝐵, 𝐴⟩})
3		opex 5402	. . . 4 ⊢ ⟨𝐵, 𝐴⟩ ∈ V
4	3	unisn 4875	. . 3 ⊢ ∪ {⟨𝐵, 𝐴⟩} = ⟨𝐵, 𝐴⟩
5	2, 4	eqtrdi 2782	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ ^◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩)
6		uni0 4884	. . 3 ⊢ ∪ ∅ = ∅
7		opprc 4845	. . . . . . 7 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = ∅)
8	7	sneqd 4585	. . . . . 6 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} = {∅})
9	8	cnveqd 5814	. . . . 5 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ^◡{⟨𝐴, 𝐵⟩} = ^◡{∅})
10		cnvsn0 6157	. . . . 5 ⊢ ^◡{∅} = ∅
11	9, 10	eqtrdi 2782	. . . 4 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ^◡{⟨𝐴, 𝐵⟩} = ∅)
12	11	unieqd 4869	. . 3 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ ^◡{⟨𝐴, 𝐵⟩} = ∪ ∅)
13		ancom 460	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐵 ∈ V ∧ 𝐴 ∈ V))
14		opprc 4845	. . . 4 ⊢ (¬ (𝐵 ∈ V ∧ 𝐴 ∈ V) → ⟨𝐵, 𝐴⟩ = ∅)
15	13, 14	sylnbi 330	. . 3 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐵, 𝐴⟩ = ∅)
16	6, 12, 15	3eqtr4a 2792	. 2 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ ^◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩)
17	5, 16	pm2.61i 182	1 ⊢ ∪ ^◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ∧ wa 395 = wceq 1541 ∈ wcel 2111 Vcvv 3436 ∅c0 4280 {csn 4573 ⟨cop 4579 ∪ cuni 4856 ^◡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-ne 2929 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-uni 4857 df-br 5090 df-opab 5152 df-xp 5620 df-rel 5621 df-cnv 5622 df-dm 5624 df-rn 5625

This theorem is referenced by: 2nd1st 7970 cnvf1olem 8040 brtpos 8165 dftpos4 8175 tpostpos 8176 xpcomco 8980 fsumcnv 15680 fprodcnv 15890 gsumcom2 19887 txswaphmeolem 23719 swapf1 49383 swapf2 49385