Theorem eldisjs6 40063

Description: Elementhood in the class of disjoints. A relation 𝑅 is in Disjs iff:

it is relation-typed, and

its quotient-map QMap 𝑅 is itself disjoint, and

its quotient-carrier ran QMap 𝑅 = (dom 𝑅 / 𝑅) lies in ElDisjs (element-disjoint carriers).

This is the central "stability-by-decomposition" theorem for Disjs: it explains why Disjs is internally well-behaved without adding an external stability clause. It is the exact template that PetParts imitates: for pet 40088, the analogue of "map layer" is the disjointness of the lifted span, the analogue of "carrier layer" is the block-lift fixpoint (BlockLiftFix), and then adds external grade stability (SucMap ShiftStable) which Disjs does not need. (Contributed by Peter Mazsa, 16-Feb-2026.)

Assertion

Ref	Expression
eldisjs6	⊢ (𝑅 ∈ Disjs ↔ (𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )))

Proof of Theorem eldisjs6

Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldisjsim2 40058	. . 3 ⊢ (𝑅 ∈ Disjs → 𝑅 ∈ Rels )
2		eldisjsim4 40061	. . 3 ⊢ (𝑅 ∈ Disjs → ran QMap 𝑅 ∈ ElDisjs )
3		eldisjsim5 40062	. . 3 ⊢ (𝑅 ∈ Disjs → QMap 𝑅 ∈ Disjs )
4	1, 2, 3	jca32 525	. 2 ⊢ (𝑅 ∈ Disjs → (𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )))
5		rnqmapeleldisjsim 39985	. . . . . . 7 ⊢ ((𝑅 ∈ Rels ∧ ran QMap 𝑅 ∈ ElDisjs ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → (([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → [𝑢]𝑅 = [𝑣]𝑅))
6	5	3adant2r 1198	. . . . . 6 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs ) ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → (([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → [𝑢]𝑅 = [𝑣]𝑅))
7		qmapeldisjsim 39983	. . . . . . 7 ⊢ ((𝑅 ∈ Rels ∧ QMap 𝑅 ∈ Disjs ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → ([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣))
8	7	3adant2l 1197	. . . . . 6 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs ) ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → ([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣))
9	6, 8	syld 48	. . . . 5 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs ) ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → (([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣))
10	9	3expia 1139	. . . 4 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )) → ((𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅) → (([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣)))
11	10	ralrimivv 3207	. . 3 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )) → ∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣))
12		elrelsrelim 39566	. . . . . 6 ⊢ (𝑅 ∈ Rels → Rel 𝑅)
13		dfdisjALTV5a 39926	. . . . . . 7 ⊢ ( Disj 𝑅 ↔ (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) ∧ Rel 𝑅))
14	13	simplbi2com 508	. . . . . 6 ⊢ (Rel 𝑅 → (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) → Disj 𝑅))
15	12, 14	syl 18	. . . . 5 ⊢ (𝑅 ∈ Rels → (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) → Disj 𝑅))
16		eldisjsdisj 39947	. . . . 5 ⊢ (𝑅 ∈ Rels → (𝑅 ∈ Disjs ↔ Disj 𝑅))
17	15, 16	sylibrd 262	. . . 4 ⊢ (𝑅 ∈ Rels → (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) → 𝑅 ∈ Disjs ))
18	17	adantr 486	. . 3 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )) → (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) → 𝑅 ∈ Disjs ))
19	11, 18	mpd 16	. 2 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )) → 𝑅 ∈ Disjs )
20	4, 19	impbii 212	1 ⊢ (𝑅 ∈ Disjs ↔ (𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080   ∩ cin 4092  ∅c0 4281  dom cdm 5655  ran crn 5656  Rel wrel 5660  [cec 8740   QMap cqmap 39298   Rels crels 39308   Disjs cdisjs 39341   Disj wdisjALTV 39342   ElDisjs celdisjs 39343

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:  eldisjs7  40064  dfdisjs6  40065