Theorem preq12nebg 4862

Description: Equality relationship for two proper unordered pairs. (Contributed by AV, 12-Jun-2022.)

Assertion

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

Proof of Theorem preq12nebg

Step	Hyp	Ref	Expression
1		3simpa 1148	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊))
2	1	anim1i 615	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)))
3	2	ancoms 458	. . . 4 ⊢ (((𝐶 ∈ V ∧ 𝐷 ∈ V) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵)) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)))
4		preq12bg 4852	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
5	3, 4	syl 17	. . 3 ⊢ (((𝐶 ∈ V ∧ 𝐷 ∈ V) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
6	5	ex 412	. 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)))))
7		ianor 983	. . 3 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) ↔ (¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V))
8		prneprprc 4860	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵} ≠ {𝐶, 𝐷})
9	8	ancoms 458	. . . . . . 7 ⊢ ((¬ 𝐶 ∈ V ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵)) → {𝐴, 𝐵} ≠ {𝐶, 𝐷})
10		eqneqall 2950	. . . . . . 7 ⊢ ({𝐴, 𝐵} = {𝐶, 𝐷} → ({𝐴, 𝐵} ≠ {𝐶, 𝐷} → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
11	9, 10	syl5com 31	. . . . . 6 ⊢ ((¬ 𝐶 ∈ V ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵)) → ({𝐴, 𝐵} = {𝐶, 𝐷} → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
12		prneprprc 4860	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐷 ∈ V) → {𝐴, 𝐵} ≠ {𝐷, 𝐶})
13	12	ancoms 458	. . . . . . 7 ⊢ ((¬ 𝐷 ∈ V ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵)) → {𝐴, 𝐵} ≠ {𝐷, 𝐶})
14		prcom 4731	. . . . . . . . 9 ⊢ {𝐶, 𝐷} = {𝐷, 𝐶}
15	14	eqeq2i 2749	. . . . . . . 8 ⊢ ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ {𝐴, 𝐵} = {𝐷, 𝐶})
16		eqneqall 2950	. . . . . . . 8 ⊢ ({𝐴, 𝐵} = {𝐷, 𝐶} → ({𝐴, 𝐵} ≠ {𝐷, 𝐶} → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
17	15, 16	sylbi 217	. . . . . . 7 ⊢ ({𝐴, 𝐵} = {𝐶, 𝐷} → ({𝐴, 𝐵} ≠ {𝐷, 𝐶} → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
18	13, 17	syl5com 31	. . . . . 6 ⊢ ((¬ 𝐷 ∈ V ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵)) → ({𝐴, 𝐵} = {𝐶, 𝐷} → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
19	11, 18	jaoian 958	. . . . 5 ⊢ (((¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵)) → ({𝐴, 𝐵} = {𝐶, 𝐷} → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
20		preq12 4734	. . . . . 6 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐴, 𝐵} = {𝐶, 𝐷})
21		preq12 4734	. . . . . . 7 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → {𝐴, 𝐵} = {𝐷, 𝐶})
22		prcom 4731	. . . . . . 7 ⊢ {𝐷, 𝐶} = {𝐶, 𝐷}
23	21, 22	eqtrdi 2792	. . . . . 6 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → {𝐴, 𝐵} = {𝐶, 𝐷})
24	20, 23	jaoi 857	. . . . 5 ⊢ (((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)) → {𝐴, 𝐵} = {𝐶, 𝐷})
25	19, 24	impbid1 225	. . . 4 ⊢ (((¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵)) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))
26	25	ex 412	. . 3 ⊢ ((¬ 𝐶 ∈ V ∨ ¬ 𝐷 ∈ V) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)))))
27	7, 26	sylbi 217	. 2 ⊢ (¬ (𝐶 ∈ V ∧ 𝐷 ∈ V) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶)))))
28	6, 27	pm2.61i 182	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({𝐴, 𝐵} = {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∨ (𝐴 = 𝐷 ∧ 𝐵 = 𝐶))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1539   ∈ wcel 2107   ≠ wne 2939  Vcvv 3479  {cpr 4627

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-ne 2940  df-v 3481  df-dif 3953  df-un 3955  df-nul 4333  df-sn 4626  df-pr 4628

This theorem is referenced by:  prel12g  4863  opthhausdorff  5521  preleqg  9656  pr2cv  43566