Theorem bj-2upln1upl 35997

Description: A couple is never equal to a monuple. It is in order to have this "non-clashing" result that tagging was used. Without tagging, we would have ⦅𝐴, ∅⦆ = ⦅𝐴⦆. Note that in the context of Morse tuples, it is natural to define the 0-tuple as the empty set. Therefore, the present theorem together with bj-1upln0 35982 and bj-2upln0 35996 tell us that an m-tuple may equal an n-tuple only when m = n, at least for m, n <= 2, but this result would extend as soon as we define n-tuples for higher values of n. (Contributed by BJ, 21-Apr-2019.)

Assertion

Ref	Expression
bj-2upln1upl	⊢ ⦅𝐴, 𝐵⦆ ≠ ⦅𝐶⦆

Proof of Theorem bj-2upln1upl

Step	Hyp	Ref	Expression
1		xpundi 5744	. . . . . . 7 ⊢ ({∅} × (tag 𝐴 ∪ tag 𝐶)) = (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))
2	1	difeq2i 4119	. . . . . 6 ⊢ (({1o} × tag 𝐵) ∖ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶)))
3		incom 4201	. . . . . . . . 9 ⊢ (({∅} × (tag 𝐴 ∪ tag 𝐶)) ∩ ({1o} × tag 𝐵)) = (({1o} × tag 𝐵) ∩ ({∅} × (tag 𝐴 ∪ tag 𝐶)))
4		xp01disjl 8494	. . . . . . . . 9 ⊢ (({∅} × (tag 𝐴 ∪ tag 𝐶)) ∩ ({1o} × tag 𝐵)) = ∅
5	3, 4	eqtr3i 2762	. . . . . . . 8 ⊢ (({1o} × tag 𝐵) ∩ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = ∅
6		disjdif2 4479	. . . . . . . 8 ⊢ ((({1o} × tag 𝐵) ∩ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = ∅ → (({1o} × tag 𝐵) ∖ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = ({1o} × tag 𝐵))
7	5, 6	ax-mp 5	. . . . . . 7 ⊢ (({1o} × tag 𝐵) ∖ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = ({1o} × tag 𝐵)
8		1oex 8478	. . . . . . . . . 10 ⊢ 1o ∈ V
9	8	snnz 4780	. . . . . . . . 9 ⊢ {1o} ≠ ∅
10		bj-tagn0 35952	. . . . . . . . 9 ⊢ tag 𝐵 ≠ ∅
11	9, 10	pm3.2i 471	. . . . . . . 8 ⊢ ({1o} ≠ ∅ ∧ tag 𝐵 ≠ ∅)
12		xpnz 6158	. . . . . . . 8 ⊢ (({1o} ≠ ∅ ∧ tag 𝐵 ≠ ∅) ↔ ({1o} × tag 𝐵) ≠ ∅)
13	11, 12	mpbi 229	. . . . . . 7 ⊢ ({1o} × tag 𝐵) ≠ ∅
14	7, 13	eqnetri 3011	. . . . . 6 ⊢ (({1o} × tag 𝐵) ∖ ({∅} × (tag 𝐴 ∪ tag 𝐶))) ≠ ∅
15	2, 14	eqnetrri 3012	. . . . 5 ⊢ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ≠ ∅
16		0pss 4444	. . . . 5 ⊢ (∅ ⊊ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ↔ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ≠ ∅)
17	15, 16	mpbir 230	. . . 4 ⊢ ∅ ⊊ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶)))
18		ssun2 4173	. . . . . . . 8 ⊢ ({∅} × tag 𝐶) ⊆ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))
19		sscon 4138	. . . . . . . 8 ⊢ (({∅} × tag 𝐶) ⊆ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶)) → (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (({1o} × tag 𝐵) ∖ ({∅} × tag 𝐶)))
20	18, 19	ax-mp 5	. . . . . . 7 ⊢ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (({1o} × tag 𝐵) ∖ ({∅} × tag 𝐶))
21		ssun2 4173	. . . . . . . 8 ⊢ ({1o} × tag 𝐵) ⊆ (({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵))
22		ssdif 4139	. . . . . . . 8 ⊢ (({1o} × tag 𝐵) ⊆ (({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) → (({1o} × tag 𝐵) ∖ ({∅} × tag 𝐶)) ⊆ ((({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) ∖ ({∅} × tag 𝐶)))
23	21, 22	ax-mp 5	. . . . . . 7 ⊢ (({1o} × tag 𝐵) ∖ ({∅} × tag 𝐶)) ⊆ ((({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) ∖ ({∅} × tag 𝐶))
24	20, 23	sstri 3991	. . . . . 6 ⊢ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ ((({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) ∖ ({∅} × tag 𝐶))
25		df-bj-2upl 35984	. . . . . . . 8 ⊢ ⦅𝐴, 𝐵⦆ = (⦅𝐴⦆ ∪ ({1o} × tag 𝐵))
26		df-bj-1upl 35971	. . . . . . . . 9 ⊢ ⦅𝐴⦆ = ({∅} × tag 𝐴)
27	26	uneq1i 4159	. . . . . . . 8 ⊢ (⦅𝐴⦆ ∪ ({1o} × tag 𝐵)) = (({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵))
28	25, 27	eqtri 2760	. . . . . . 7 ⊢ ⦅𝐴, 𝐵⦆ = (({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵))
29	28	difeq1i 4118	. . . . . 6 ⊢ (⦅𝐴, 𝐵⦆ ∖ ({∅} × tag 𝐶)) = ((({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) ∖ ({∅} × tag 𝐶))
30	24, 29	sseqtrri 4019	. . . . 5 ⊢ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (⦅𝐴, 𝐵⦆ ∖ ({∅} × tag 𝐶))
31		df-bj-1upl 35971	. . . . . 6 ⊢ ⦅𝐶⦆ = ({∅} × tag 𝐶)
32	31	difeq2i 4119	. . . . 5 ⊢ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) = (⦅𝐴, 𝐵⦆ ∖ ({∅} × tag 𝐶))
33	30, 32	sseqtrri 4019	. . . 4 ⊢ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆)
34		psssstr 4106	. . . 4 ⊢ ((∅ ⊊ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ∧ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆)) → ∅ ⊊ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆))
35	17, 33, 34	mp2an 690	. . 3 ⊢ ∅ ⊊ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆)
36		0pss 4444	. . 3 ⊢ (∅ ⊊ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) ↔ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) ≠ ∅)
37	35, 36	mpbi 229	. 2 ⊢ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) ≠ ∅
38		difn0 4364	. 2 ⊢ ((⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) ≠ ∅ → ⦅𝐴, 𝐵⦆ ≠ ⦅𝐶⦆)
39	37, 38	ax-mp 5	1 ⊢ ⦅𝐴, 𝐵⦆ ≠ ⦅𝐶⦆

Syntax hints:   ∧ wa 396   = wceq 1541   ≠ wne 2940   ∖ cdif 3945   ∪ cun 3946   ∩ cin 3947   ⊆ wss 3948   ⊊ wpss 3949  ∅c0 4322  {csn 4628   × cxp 5674  1_oc1o 8461  tag bj-ctag 35947  ⦅bj-c1upl 35970  ⦅bj-c2uple 35983

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-xp 5682  df-rel 5683  df-cnv 5684  df-suc 6370  df-1o 8468  df-bj-tag 35948  df-bj-1upl 35971  df-bj-2upl 35984

This theorem is referenced by: (None)