| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfpart2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the partition predicate. (Contributed by Peter Mazsa, 5-Sep-2021.) |
| Ref | Expression |
|---|---|
| dfpart2 | ⊢ (𝑅 Part 𝐴 ↔ ( Disj 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-part 39559 | . 2 ⊢ (𝑅 Part 𝐴 ↔ ( Disj 𝑅 ∧ 𝑅 DomainQs 𝐴)) | |
| 2 | df-dmqs 39413 | . . 3 ⊢ (𝑅 DomainQs 𝐴 ↔ (dom 𝑅 / 𝑅) = 𝐴) | |
| 3 | 2 | anbi2i 635 | . 2 ⊢ (( Disj 𝑅 ∧ 𝑅 DomainQs 𝐴) ↔ ( Disj 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) |
| 4 | 1, 3 | bitri 278 | 1 ⊢ (𝑅 Part 𝐴 ↔ ( Disj 𝑅 ∧ (dom 𝑅 / 𝑅) = 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 dom cdm 5666 / cqs 8702 DomainQs wdmqs 38897 Disj wdisjALTV 38909 Part wpart 38914 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This proof depends on definitions: df-bi 210 df-an 402 df-dmqs 39413 df-part 39559 |
| This theorem is used by: parteq1 39567 parteq2 39568 partim 39601 pet0 39608 petid 39610 petidres 39612 petinidres 39614 petxrnidres 39616 petincnvepres 39653 pet 39655 |
| Copyright terms: Public domain | W3C validator |