Theorem ssprsseq 4780

Description: A proper pair is a subset of a pair iff it is equal to the superset. (Contributed by AV, 26-Oct-2020.)

Assertion

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

Proof of Theorem ssprsseq

Step	Hyp	Ref	Expression
1		ssprss 4779	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐴, 𝐵} ⊆ {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∨ 𝐴 = 𝐷) ∧ (𝐵 = 𝐶 ∨ 𝐵 = 𝐷))))
2	1	3adant3 1150	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({𝐴, 𝐵} ⊆ {𝐶, 𝐷} ↔ ((𝐴 = 𝐶 ∨ 𝐴 = 𝐷) ∧ (𝐵 = 𝐶 ∨ 𝐵 = 𝐷))))
3		eqneqall 2966	. . . . . . . 8 ⊢ (𝐴 = 𝐵 → (𝐴 ≠ 𝐵 → {𝐴, 𝐵} = {𝐶, 𝐷}))
4		eqtr3 2782	. . . . . . . 8 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐵)
5	3, 4	syl11 34	. . . . . . 7 ⊢ (𝐴 ≠ 𝐵 → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐶) → {𝐴, 𝐵} = {𝐶, 𝐷}))
6	5	3ad2ant3 1153	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ((𝐴 = 𝐶 ∧ 𝐵 = 𝐶) → {𝐴, 𝐵} = {𝐶, 𝐷}))
7	6	com12 33	. . . . 5 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐶) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} = {𝐶, 𝐷}))
8		preq12 4692	. . . . . . 7 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → {𝐴, 𝐵} = {𝐷, 𝐶})
9		prcom 4689	. . . . . . 7 ⊢ {𝐷, 𝐶} = {𝐶, 𝐷}
10	8, 9	eqtrdi 2811	. . . . . 6 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → {𝐴, 𝐵} = {𝐶, 𝐷})
11	10	a1d 26	. . . . 5 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐶) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} = {𝐶, 𝐷}))
12		preq12 4692	. . . . . 6 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → {𝐴, 𝐵} = {𝐶, 𝐷})
13	12	a1d 26	. . . . 5 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} = {𝐶, 𝐷}))
14		eqtr3 2782	. . . . . . . 8 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐷) → 𝐴 = 𝐵)
15	3, 14	syl11 34	. . . . . . 7 ⊢ (𝐴 ≠ 𝐵 → ((𝐴 = 𝐷 ∧ 𝐵 = 𝐷) → {𝐴, 𝐵} = {𝐶, 𝐷}))
16	15	3ad2ant3 1153	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ((𝐴 = 𝐷 ∧ 𝐵 = 𝐷) → {𝐴, 𝐵} = {𝐶, 𝐷}))
17	16	com12 33	. . . . 5 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐷) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} = {𝐶, 𝐷}))
18	7, 11, 13, 17	ccase 1053	. . . 4 ⊢ (((𝐴 = 𝐶 ∨ 𝐴 = 𝐷) ∧ (𝐵 = 𝐶 ∨ 𝐵 = 𝐷)) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} = {𝐶, 𝐷}))
19	18	com12 33	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → (((𝐴 = 𝐶 ∨ 𝐴 = 𝐷) ∧ (𝐵 = 𝐶 ∨ 𝐵 = 𝐷)) → {𝐴, 𝐵} = {𝐶, 𝐷}))
20	2, 19	sylbid 243	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({𝐴, 𝐵} ⊆ {𝐶, 𝐷} → {𝐴, 𝐵} = {𝐶, 𝐷}))
21		eqimss 3966	. 2 ⊢ ({𝐴, 𝐵} = {𝐶, 𝐷} → {𝐴, 𝐵} ⊆ {𝐶, 𝐷})
22	20, 21	impbid1 228	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → ({𝐴, 𝐵} ⊆ {𝐶, 𝐷} ↔ {𝐴, 𝐵} = {𝐶, 𝐷}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955   ⊆ wss 3895  {cpr 4586

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-v 3452  df-ss 3896  df-un 4151  df-sn 4585  df-pr 4587

This theorem is used by:  upgredgpr  29726  cyc3genpmlem  33759