Theorem poprelb 46490

Description: Equality for unordered pairs with partially ordered elements. (Contributed by AV, 9-Jul-2023.)

Assertion

Ref	Expression
poprelb	⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))

Proof of Theorem poprelb

Step	Hyp	Ref	Expression
1		simp2 1135	. . 3 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋))
2		an3 655	. . . . 5 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → (Rel 𝑅 ∧ 𝐶𝑅𝐷))
3	2	3adant2 1129	. . . 4 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → (Rel 𝑅 ∧ 𝐶𝑅𝐷))
4		brrelex12 5727	. . . 4 ⊢ ((Rel 𝑅 ∧ 𝐶𝑅𝐷) → (𝐶 ∈ V ∧ 𝐷 ∈ V))
5	3, 4	syl 17	. . 3 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → (𝐶 ∈ V ∧ 𝐷 ∈ V))
6		preq12bg 4853	. . 3 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
7	1, 5, 6	syl2anc 582	. 2 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
8		idd 24	. . . 4 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
9		breq12 5152	. . . . . . . . . . 11 ⊢ ((𝐵 = 𝐶 ∧ 𝐴 = 𝐷) → (𝐵𝑅𝐴 ↔ 𝐶𝑅𝐷))
10	9	ancoms 457	. . . . . . . . . 10 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → (𝐵𝑅𝐴 ↔ 𝐶𝑅𝐷))
11	10	bicomd 222	. . . . . . . . 9 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → (𝐶𝑅𝐷 ↔ 𝐵𝑅𝐴))
12	11	anbi2d 627	. . . . . . . 8 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → ((𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷) ↔ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴)))
13		po2nr 5601	. . . . . . . . . . . 12 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ¬ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴))
14	13	adantll 710	. . . . . . . . . . 11 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ¬ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴))
15	14	pm2.21d 121	. . . . . . . . . 10 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
16	15	ex 411	. . . . . . . . 9 ⊢ ((Rel 𝑅 ∧ 𝑅 Po 𝑋) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))))
17	16	com13 88	. . . . . . . 8 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((Rel 𝑅 ∧ 𝑅 Po 𝑋) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))))
18	12, 17	syl6bi 252	. . . . . . 7 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → ((𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((Rel 𝑅 ∧ 𝑅 Po 𝑋) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))))
19	18	com23 86	. . . . . 6 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷) → ((Rel 𝑅 ∧ 𝑅 Po 𝑋) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))))
20	19	com14 96	. . . . 5 ⊢ ((Rel 𝑅 ∧ 𝑅 Po 𝑋) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷) → ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))))
21	20	3imp 1109	. . . 4 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
22	8, 21	jaod 855	. . 3 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → (((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
23		orc 863	. . 3 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)))
24	22, 23	impbid1 224	. 2 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → (((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
25	7, 24	bitrd 278	1 ⊢ (((Rel 𝑅 ∧ 𝑅 Po 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝐴𝑅𝐵 ∧ 𝐶𝑅𝐷)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 394   ∨ wo 843   ∧ w3a 1085   = wceq 1539   ∈ wcel 2104  Vcvv 3472  {cpr 4629   class class class wbr 5147   Po wpo 5585  Rel wrel 5680

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2722  df-clel 2808  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-br 5148  df-opab 5210  df-po 5587  df-xp 5681  df-rel 5682

This theorem is referenced by: (None)