Theorem opthprneg 4889

Description: An unordered pair has the ordered pair property (compare opth 5496) under certain conditions. Variant of opthpr 4876 in closed form. (Contributed by AV, 13-Jun-2022.)

Assertion

Ref	Expression
opthprneg	⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))

Proof of Theorem opthprneg

Step	Hyp	Ref	Expression
1		preq12bg 4878	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
2	1	adantlr 714	. . . 4 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
3		idd 24	. . . . . . . 8 ⊢ (𝐴 ≠ 𝐷 → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
4		df-ne 2947	. . . . . . . . . 10 ⊢ (𝐴 ≠ 𝐷 ↔ ¬ 𝐴 = 𝐷)
5		pm2.21 123	. . . . . . . . . 10 ⊢ (¬ 𝐴 = 𝐷 → (𝐴 = 𝐷 → (𝐵 = 𝐶 → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))))
6	4, 5	sylbi 217	. . . . . . . . 9 ⊢ (𝐴 ≠ 𝐷 → (𝐴 = 𝐷 → (𝐵 = 𝐶 → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))))
7	6	impd 410	. . . . . . . 8 ⊢ (𝐴 ≠ 𝐷 → ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
8	3, 7	jaod 858	. . . . . . 7 ⊢ (𝐴 ≠ 𝐷 → (((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
9		orc 866	. . . . . . 7 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)))
10	8, 9	impbid1 225	. . . . . 6 ⊢ (𝐴 ≠ 𝐷 → (((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
11	10	adantl 481	. . . . 5 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷) → (((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
12	11	ad2antlr 726	. . . 4 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → (((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
13	2, 12	bitrd 279	. . 3 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
14	13	expcom 413	. 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))))
15		ianor 982	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) ↔ (¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V))
16		simpl 482	. . . . . . . . . . 11 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷) → 𝐴 ≠ 𝐵)
17	16	anim2i 616	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝐴 ≠ 𝐵))
18		df-3an 1089	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ↔ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝐴 ≠ 𝐵))
19	17, 18	sylibr 234	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵))
20		prneprprc 4885	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵} ≠ {𝐶, 𝐷})
21	19, 20	sylan 579	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵} ≠ {𝐶, 𝐷})
22	21	ancoms 458	. . . . . . 7 ⊢ ((¬ 𝐶 ∈ V ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷))) → {𝐴, 𝐵} ≠ {𝐶, 𝐷})
23		eqneqall 2957	. . . . . . 7 ⊢ ({𝐴, 𝐵} = {𝐶, 𝐷} → ({𝐴, 𝐵} ≠ {𝐶, 𝐷} → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
24	22, 23	syl5com 31	. . . . . 6 ⊢ ((¬ 𝐶 ∈ V ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷))) → ({𝐴, 𝐵} = {𝐶, 𝐷} → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
25		prneprprc 4885	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐷 ∈ V) → {𝐴, 𝐵} ≠ {𝐷, 𝐶})
26	19, 25	sylan 579	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) ∧ ¬ 𝐷 ∈ V) → {𝐴, 𝐵} ≠ {𝐷, 𝐶})
27	26	ancoms 458	. . . . . . 7 ⊢ ((¬ 𝐷 ∈ V ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷))) → {𝐴, 𝐵} ≠ {𝐷, 𝐶})
28		prcom 4757	. . . . . . . . 9 ⊢ {𝐶, 𝐷} = {𝐷, 𝐶}
29	28	eqeq2i 2753	. . . . . . . 8 ⊢ ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ {𝐴, 𝐵} = {𝐷, 𝐶})
30		eqneqall 2957	. . . . . . . 8 ⊢ ({𝐴, 𝐵} = {𝐷, 𝐶} → ({𝐴, 𝐵} ≠ {𝐷, 𝐶} → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
31	29, 30	sylbi 217	. . . . . . 7 ⊢ ({𝐴, 𝐵} = {𝐶, 𝐷} → ({𝐴, 𝐵} ≠ {𝐷, 𝐶} → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
32	27, 31	syl5com 31	. . . . . 6 ⊢ ((¬ 𝐷 ∈ V ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷))) → ({𝐴, 𝐵} = {𝐶, 𝐷} → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
33	24, 32	jaoian 957	. . . . 5 ⊢ (((¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V) ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷))) → ({𝐴, 𝐵} = {𝐶, 𝐷} → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
34		preq12 4760	. . . . 5 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐴, 𝐵} = {𝐶, 𝐷})
35	33, 34	impbid1 225	. . . 4 ⊢ (((¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V) ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷))) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
36	35	ex 412	. . 3 ⊢ ((¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V) → (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))))
37	15, 36	sylbi 217	. 2 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))))
38	14, 37	pm2.61i 182	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐷)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 846   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  Vcvv 3488  {cpr 4650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-v 3490  df-dif 3979  df-un 3981  df-nul 4353  df-sn 4649  df-pr 4651

This theorem is referenced by:  linds2eq  33374