Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfdisjs7 Structured version   Visualization version   GIF version

Theorem dfdisjs7 40066
Description: Alternate definition of the class of disjoints (via carrier disjointness + unique representatives). Ideology-free normal form of dfdisjs6 40065: "blocks cover their elements" (∃*) and "each block has a unique generator" (∃!), expressed entirely at the quotient-carrier level. Same class as dfdisjs6 40065, but presented in fully expanded ∃* / ∃! form over the quotient-carrier (dom 𝑟 / 𝑟). Makes explicit (a) element-disjointness of the quotient-carrier and (b) unique representative existence for each block. These are exactly the two conditions that rule out type-confusions (blocks vs witnesses) and ensure canonical decomposition. This is the form that best supports analogy arguments with df-petparts 40091 and with successor-style uniqueness patterns. (Contributed by Peter Mazsa, 16-Feb-2026.)
Assertion
Ref Expression
dfdisjs7 Disjs = {𝑟 ∈ Rels ∣ (∀𝑥∃*𝑢 ∈ (dom 𝑟 / 𝑟)𝑥 ∈ 𝑢 ∧ ∀𝑢 ∈ (dom 𝑟 / 𝑟)∃!𝑡 ∈ dom 𝑟 𝑢 = [𝑡]𝑟)}
Distinct variable groups:   𝑡,𝑟,𝑢   𝑥,𝑟,𝑢

Proof of Theorem dfdisjs7
StepHypRef Expression
1 eldisjs7 40064 . 2 (𝑟 ∈ Disjs ↔ (𝑟 ∈ Rels ∧ (∀𝑥∃*𝑢 ∈ (dom 𝑟 / 𝑟)𝑥 ∈ 𝑢 ∧ ∀𝑢 ∈ (dom 𝑟 / 𝑟)∃!𝑡 ∈ dom 𝑟 𝑢 = [𝑡]𝑟)))
21eqrabi 39379 1 Disjs = {𝑟 ∈ Rels ∣ (∀𝑥∃*𝑢 ∈ (dom 𝑟 / 𝑟)𝑥 ∈ 𝑢 ∧ ∀𝑢 ∈ (dom 𝑟 / 𝑟)∃!𝑡 ∈ dom 𝑟 𝑢 = [𝑡]𝑟)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃!wreu 3367  ∃*wrmo 3368  {crab 3416  dom cdm 5655  [cec 8740   / cqs 8741   Rels crels 39308   Disjs cdisjs 39341
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-eprel 5555  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ec 8744  df-qs 8748  df-rels 39563  df-qmap 39569  df-coss 39624  df-ssr 39701  df-refrel 39715  df-cnvrefs 39728  df-cnvrefrels 39729  df-cnvrefrel 39730  df-symrel 39747  df-trrel 39781  df-eqvrel 39792  df-funALTV 39890  df-disjss 39911  df-disjs 39912  df-disjALTV 39913  df-eldisjs 39914  df-eldisj 39915
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator