Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-2upln1upl Structured version   Visualization version   GIF version

Theorem bj-2upln1upl 36396
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 36381 and bj-2upln0 36395 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
StepHypRef Expression
1 xpundi 5735 . . . . . . 7 ({∅} × (tag 𝐴 ∪ tag 𝐶)) = (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))
21difeq2i 4112 . . . . . 6 (({1o} × tag 𝐵) ∖ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶)))
3 incom 4194 . . . . . . . . 9 (({∅} × (tag 𝐴 ∪ tag 𝐶)) ∩ ({1o} × tag 𝐵)) = (({1o} × tag 𝐵) ∩ ({∅} × (tag 𝐴 ∪ tag 𝐶)))
4 xp01disjl 8488 . . . . . . . . 9 (({∅} × (tag 𝐴 ∪ tag 𝐶)) ∩ ({1o} × tag 𝐵)) = ∅
53, 4eqtr3i 2754 . . . . . . . 8 (({1o} × tag 𝐵) ∩ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = ∅
6 disjdif2 4472 . . . . . . . 8 ((({1o} × tag 𝐵) ∩ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = ∅ → (({1o} × tag 𝐵) ∖ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = ({1o} × tag 𝐵))
75, 6ax-mp 5 . . . . . . 7 (({1o} × tag 𝐵) ∖ ({∅} × (tag 𝐴 ∪ tag 𝐶))) = ({1o} × tag 𝐵)
8 1oex 8472 . . . . . . . . . 10 1o ∈ V
98snnz 4773 . . . . . . . . 9 {1o} ≠ ∅
10 bj-tagn0 36351 . . . . . . . . 9 tag 𝐵 ≠ ∅
119, 10pm3.2i 470 . . . . . . . 8 ({1o} ≠ ∅ ∧ tag 𝐵 ≠ ∅)
12 xpnz 6149 . . . . . . . 8 (({1o} ≠ ∅ ∧ tag 𝐵 ≠ ∅) ↔ ({1o} × tag 𝐵) ≠ ∅)
1311, 12mpbi 229 . . . . . . 7 ({1o} × tag 𝐵) ≠ ∅
147, 13eqnetri 3003 . . . . . 6 (({1o} × tag 𝐵) ∖ ({∅} × (tag 𝐴 ∪ tag 𝐶))) ≠ ∅
152, 14eqnetrri 3004 . . . . 5 (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ≠ ∅
16 0pss 4437 . . . . 5 (∅ ⊊ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ↔ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ≠ ∅)
1715, 16mpbir 230 . . . 4 ∅ ⊊ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶)))
18 ssun2 4166 . . . . . . . 8 ({∅} × tag 𝐶) ⊆ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))
19 sscon 4131 . . . . . . . 8 (({∅} × tag 𝐶) ⊆ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶)) → (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (({1o} × tag 𝐵) ∖ ({∅} × tag 𝐶)))
2018, 19ax-mp 5 . . . . . . 7 (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (({1o} × tag 𝐵) ∖ ({∅} × tag 𝐶))
21 ssun2 4166 . . . . . . . 8 ({1o} × tag 𝐵) ⊆ (({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵))
22 ssdif 4132 . . . . . . . 8 (({1o} × tag 𝐵) ⊆ (({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) → (({1o} × tag 𝐵) ∖ ({∅} × tag 𝐶)) ⊆ ((({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) ∖ ({∅} × tag 𝐶)))
2321, 22ax-mp 5 . . . . . . 7 (({1o} × tag 𝐵) ∖ ({∅} × tag 𝐶)) ⊆ ((({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) ∖ ({∅} × tag 𝐶))
2420, 23sstri 3984 . . . . . 6 (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ ((({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) ∖ ({∅} × tag 𝐶))
25 df-bj-2upl 36383 . . . . . . . 8 𝐴, 𝐵⦆ = (⦅𝐴⦆ ∪ ({1o} × tag 𝐵))
26 df-bj-1upl 36370 . . . . . . . . 9 𝐴⦆ = ({∅} × tag 𝐴)
2726uneq1i 4152 . . . . . . . 8 (⦅𝐴⦆ ∪ ({1o} × tag 𝐵)) = (({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵))
2825, 27eqtri 2752 . . . . . . 7 𝐴, 𝐵⦆ = (({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵))
2928difeq1i 4111 . . . . . 6 (⦅𝐴, 𝐵⦆ ∖ ({∅} × tag 𝐶)) = ((({∅} × tag 𝐴) ∪ ({1o} × tag 𝐵)) ∖ ({∅} × tag 𝐶))
3024, 29sseqtrri 4012 . . . . 5 (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (⦅𝐴, 𝐵⦆ ∖ ({∅} × tag 𝐶))
31 df-bj-1upl 36370 . . . . . 6 𝐶⦆ = ({∅} × tag 𝐶)
3231difeq2i 4112 . . . . 5 (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) = (⦅𝐴, 𝐵⦆ ∖ ({∅} × tag 𝐶))
3330, 32sseqtrri 4012 . . . 4 (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆)
34 psssstr 4099 . . . 4 ((∅ ⊊ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ∧ (({1o} × tag 𝐵) ∖ (({∅} × tag 𝐴) ∪ ({∅} × tag 𝐶))) ⊆ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆)) → ∅ ⊊ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆))
3517, 33, 34mp2an 689 . . 3 ∅ ⊊ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆)
36 0pss 4437 . . 3 (∅ ⊊ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) ↔ (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) ≠ ∅)
3735, 36mpbi 229 . 2 (⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) ≠ ∅
38 difn0 4357 . 2 ((⦅𝐴, 𝐵⦆ ∖ ⦅𝐶⦆) ≠ ∅ → ⦅𝐴, 𝐵⦆ ≠ ⦅𝐶⦆)
3937, 38ax-mp 5 1 𝐴, 𝐵⦆ ≠ ⦅𝐶
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1533  wne 2932  cdif 3938  cun 3939  cin 3940  wss 3941  wpss 3942  c0 4315  {csn 4621   × cxp 5665  1oc1o 8455  tag bj-ctag 36346  bj-c1upl 36369  bj-c2uple 36382
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-sep 5290  ax-nul 5297  ax-pr 5418
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2702  df-cleq 2716  df-clel 2802  df-ne 2933  df-ral 3054  df-rex 3063  df-rab 3425  df-v 3468  df-dif 3944  df-un 3946  df-in 3948  df-ss 3958  df-pss 3960  df-nul 4316  df-if 4522  df-sn 4622  df-pr 4624  df-op 4628  df-br 5140  df-opab 5202  df-xp 5673  df-rel 5674  df-cnv 5675  df-suc 6361  df-1o 8462  df-bj-tag 36347  df-bj-1upl 36370  df-bj-2upl 36383
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator