| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eldisjs6 | Structured version Visualization version GIF version | ||
| 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 39286, 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.) |
| Ref | Expression |
|---|---|
| eldisjs6 | ⊢ (𝑅 ∈ Disjs ↔ (𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldisjsim2 39256 | . . 3 ⊢ (𝑅 ∈ Disjs → 𝑅 ∈ Rels ) | |
| 2 | eldisjsim4 39259 | . . 3 ⊢ (𝑅 ∈ Disjs → ran QMap 𝑅 ∈ ElDisjs ) | |
| 3 | eldisjsim5 39260 | . . 3 ⊢ (𝑅 ∈ Disjs → QMap 𝑅 ∈ Disjs ) | |
| 4 | 1, 2, 3 | jca32 515 | . 2 ⊢ (𝑅 ∈ Disjs → (𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs ))) |
| 5 | rnqmapeleldisjsim 39183 | . . . . . . 7 ⊢ ((𝑅 ∈ Rels ∧ ran QMap 𝑅 ∈ ElDisjs ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → (([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → [𝑢]𝑅 = [𝑣]𝑅)) | |
| 6 | 5 | 3adant2r 1181 | . . . . . 6 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs ) ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → (([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → [𝑢]𝑅 = [𝑣]𝑅)) |
| 7 | qmapeldisjsim 39181 | . . . . . . 7 ⊢ ((𝑅 ∈ Rels ∧ QMap 𝑅 ∈ Disjs ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → ([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣)) | |
| 8 | 7 | 3adant2l 1180 | . . . . . 6 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs ) ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → ([𝑢]𝑅 = [𝑣]𝑅 → 𝑢 = 𝑣)) |
| 9 | 6, 8 | syld 47 | . . . . 5 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs ) ∧ (𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅)) → (([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣)) |
| 10 | 9 | 3expia 1122 | . . . 4 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )) → ((𝑢 ∈ dom 𝑅 ∧ 𝑣 ∈ dom 𝑅) → (([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣))) |
| 11 | 10 | ralrimivv 3178 | . . 3 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )) → ∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣)) |
| 12 | elrelsrelim 38764 | . . . . . 6 ⊢ (𝑅 ∈ Rels → Rel 𝑅) | |
| 13 | dfdisjALTV5a 39124 | . . . . . . 7 ⊢ ( Disj 𝑅 ↔ (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) ∧ Rel 𝑅)) | |
| 14 | 13 | simplbi2com 502 | . . . . . 6 ⊢ (Rel 𝑅 → (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) → Disj 𝑅)) |
| 15 | 12, 14 | syl 17 | . . . . 5 ⊢ (𝑅 ∈ Rels → (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) → Disj 𝑅)) |
| 16 | eldisjsdisj 39145 | . . . . 5 ⊢ (𝑅 ∈ Rels → (𝑅 ∈ Disjs ↔ Disj 𝑅)) | |
| 17 | 15, 16 | sylibrd 259 | . . . 4 ⊢ (𝑅 ∈ Rels → (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) → 𝑅 ∈ Disjs )) |
| 18 | 17 | adantr 480 | . . 3 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )) → (∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(([𝑢]𝑅 ∩ [𝑣]𝑅) ≠ ∅ → 𝑢 = 𝑣) → 𝑅 ∈ Disjs )) |
| 19 | 11, 18 | mpd 15 | . 2 ⊢ ((𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs )) → 𝑅 ∈ Disjs ) |
| 20 | 4, 19 | impbii 209 | 1 ⊢ (𝑅 ∈ Disjs ↔ (𝑅 ∈ Rels ∧ (ran QMap 𝑅 ∈ ElDisjs ∧ QMap 𝑅 ∈ Disjs ))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∀wral 3051 ∩ cin 3888 ∅c0 4273 dom cdm 5631 ran crn 5632 Rel wrel 5636 [cec 8641 QMap cqmap 38496 Rels crels 38506 Disjs cdisjs 38539 Disj wdisjALTV 38540 ElDisjs celdisjs 38541 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-eprel 5531 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ec 8645 df-qs 8649 df-rels 38761 df-qmap 38767 df-coss 38822 df-ssr 38899 df-refrel 38913 df-cnvrefs 38926 df-cnvrefrels 38927 df-cnvrefrel 38928 df-symrel 38945 df-trrel 38979 df-eqvrel 38990 df-funALTV 39088 df-disjss 39109 df-disjs 39110 df-disjALTV 39111 df-eldisjs 39112 df-eldisj 39113 |
| This theorem is referenced by: eldisjs7 39262 dfdisjs6 39263 |
| Copyright terms: Public domain | W3C validator |