Theorem altopthsn 31238

Description: Two alternate ordered pairs are equal iff the singletons of their respective elements are equal. Note that this holds regardless of sethood of any of the elements. (Contributed by Scott Fenton, 16-Apr-2012.)

Assertion

Ref	Expression
altopthsn	⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ ({𝐴} = {𝐶} ∧ {𝐵} = {𝐷}))

Proof of Theorem altopthsn

Step	Hyp	Ref	Expression
1		df-altop 31235	. . 3 ⊢ ⟪𝐴, 𝐵⟫ = {{𝐴}, {𝐴, {𝐵}}}
2		df-altop 31235	. . 3 ⊢ ⟪𝐶, 𝐷⟫ = {{𝐶}, {𝐶, {𝐷}}}
3	1, 2	eqeq12i 2624	. 2 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ {{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}})
4		snex 4835	. . . . . 6 ⊢ {𝐴} ∈ V
5		prex 4836	. . . . . 6 ⊢ {𝐴, {𝐵}} ∈ V
6		snex 4835	. . . . . 6 ⊢ {𝐶} ∈ V
7		prex 4836	. . . . . 6 ⊢ {𝐶, {𝐷}} ∈ V
8	4, 5, 6, 7	preq12b 4322	. . . . 5 ⊢ ({{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}} ↔ (({𝐴} = {𝐶} ∧ {𝐴, {𝐵}} = {𝐶, {𝐷}}) ∨ ({𝐴} = {𝐶, {𝐷}} ∧ {𝐴, {𝐵}} = {𝐶})))
9		simpl 472	. . . . . 6 ⊢ (({𝐴} = {𝐶} ∧ {𝐴, {𝐵}} = {𝐶, {𝐷}}) → {𝐴} = {𝐶})
10		snsspr1 4285	. . . . . . . . 9 ⊢ {𝐴} ⊆ {𝐴, {𝐵}}
11		sseq2 3590	. . . . . . . . 9 ⊢ ({𝐴, {𝐵}} = {𝐶} → ({𝐴} ⊆ {𝐴, {𝐵}} ↔ {𝐴} ⊆ {𝐶}))
12	10, 11	mpbii 222	. . . . . . . 8 ⊢ ({𝐴, {𝐵}} = {𝐶} → {𝐴} ⊆ {𝐶})
13	12	adantl 481	. . . . . . 7 ⊢ (({𝐴} = {𝐶, {𝐷}} ∧ {𝐴, {𝐵}} = {𝐶}) → {𝐴} ⊆ {𝐶})
14		snsspr1 4285	. . . . . . . . 9 ⊢ {𝐶} ⊆ {𝐶, {𝐷}}
15		sseq2 3590	. . . . . . . . 9 ⊢ ({𝐴} = {𝐶, {𝐷}} → ({𝐶} ⊆ {𝐴} ↔ {𝐶} ⊆ {𝐶, {𝐷}}))
16	14, 15	mpbiri 247	. . . . . . . 8 ⊢ ({𝐴} = {𝐶, {𝐷}} → {𝐶} ⊆ {𝐴})
17	16	adantr 480	. . . . . . 7 ⊢ (({𝐴} = {𝐶, {𝐷}} ∧ {𝐴, {𝐵}} = {𝐶}) → {𝐶} ⊆ {𝐴})
18	13, 17	eqssd 3585	. . . . . 6 ⊢ (({𝐴} = {𝐶, {𝐷}} ∧ {𝐴, {𝐵}} = {𝐶}) → {𝐴} = {𝐶})
19	9, 18	jaoi 393	. . . . 5 ⊢ ((({𝐴} = {𝐶} ∧ {𝐴, {𝐵}} = {𝐶, {𝐷}}) ∨ ({𝐴} = {𝐶, {𝐷}} ∧ {𝐴, {𝐵}} = {𝐶})) → {𝐴} = {𝐶})
20	8, 19	sylbi 206	. . . 4 ⊢ ({{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}} → {𝐴} = {𝐶})
21		uneq1 3722	. . . . . . . . . 10 ⊢ ({𝐴} = {𝐶} → ({𝐴} ∪ {{𝐵}}) = ({𝐶} ∪ {{𝐵}}))
22		df-pr 4128	. . . . . . . . . 10 ⊢ {𝐴, {𝐵}} = ({𝐴} ∪ {{𝐵}})
23		df-pr 4128	. . . . . . . . . 10 ⊢ {𝐶, {𝐵}} = ({𝐶} ∪ {{𝐵}})
24	21, 22, 23	3eqtr4g 2669	. . . . . . . . 9 ⊢ ({𝐴} = {𝐶} → {𝐴, {𝐵}} = {𝐶, {𝐵}})
25	24	preq2d 4219	. . . . . . . 8 ⊢ ({𝐴} = {𝐶} → {{𝐴}, {𝐴, {𝐵}}} = {{𝐴}, {𝐶, {𝐵}}})
26		preq1 4212	. . . . . . . 8 ⊢ ({𝐴} = {𝐶} → {{𝐴}, {𝐶, {𝐵}}} = {{𝐶}, {𝐶, {𝐵}}})
27	25, 26	eqtrd 2644	. . . . . . 7 ⊢ ({𝐴} = {𝐶} → {{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐵}}})
28	27	eqeq1d 2612	. . . . . 6 ⊢ ({𝐴} = {𝐶} → ({{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}} ↔ {{𝐶}, {𝐶, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}}))
29	28	biimpd 218	. . . . 5 ⊢ ({𝐴} = {𝐶} → ({{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}} → {{𝐶}, {𝐶, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}}))
30		prex 4836	. . . . . . 7 ⊢ {𝐶, {𝐵}} ∈ V
31	30, 7	preqr2 4321	. . . . . 6 ⊢ ({{𝐶}, {𝐶, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}} → {𝐶, {𝐵}} = {𝐶, {𝐷}})
32		snex 4835	. . . . . . 7 ⊢ {𝐵} ∈ V
33		snex 4835	. . . . . . 7 ⊢ {𝐷} ∈ V
34	32, 33	preqr2 4321	. . . . . 6 ⊢ ({𝐶, {𝐵}} = {𝐶, {𝐷}} → {𝐵} = {𝐷})
35	31, 34	syl 17	. . . . 5 ⊢ ({{𝐶}, {𝐶, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}} → {𝐵} = {𝐷})
36	29, 35	syl6com 36	. . . 4 ⊢ ({{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}} → ({𝐴} = {𝐶} → {𝐵} = {𝐷}))
37	20, 36	jcai 557	. . 3 ⊢ ({{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}} → ({𝐴} = {𝐶} ∧ {𝐵} = {𝐷}))
38		preq2 4213	. . . . 5 ⊢ ({𝐵} = {𝐷} → {𝐶, {𝐵}} = {𝐶, {𝐷}})
39	38	preq2d 4219	. . . 4 ⊢ ({𝐵} = {𝐷} → {{𝐶}, {𝐶, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}})
40	27, 39	sylan9eq 2664	. . 3 ⊢ (({𝐴} = {𝐶} ∧ {𝐵} = {𝐷}) → {{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}})
41	37, 40	impbii 198	. 2 ⊢ ({{𝐴}, {𝐴, {𝐵}}} = {{𝐶}, {𝐶, {𝐷}}} ↔ ({𝐴} = {𝐶} ∧ {𝐵} = {𝐷}))
42	3, 41	bitri 263	1 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ ({𝐴} = {𝐶} ∧ {𝐵} = {𝐷}))

Syntax hints:   ↔ wb 195   ∨ wo 382   ∧ wa 383   = wceq 1475   ∪ cun 3538   ⊆ wss 3540  {csn 4125  {cpr 4127  ⟪caltop 31233

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-sn 4126  df-pr 4128  df-altop 31235

This theorem is referenced by:  altopeq12  31239  altopth1  31242  altopth2  31243  altopthg  31244  altopthbg  31245