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

Theorem pet0 38797
Description: Class 𝐴 is a partition by the null class if and only if the cosets by the null class are in equivalence relation on it. (Contributed by Peter Mazsa, 31-Dec-2021.)
Assertion
Ref Expression
pet0 (∅ Part 𝐴 ↔ ≀ ∅ ErALTV 𝐴)

Proof of Theorem pet0
StepHypRef Expression
1 pet02 38796 . 2 (( Disj ∅ ∧ (dom ∅ / ∅) = 𝐴) ↔ ( EqvRel ≀ ∅ ∧ (dom ≀ ∅ / ≀ ∅) = 𝐴))
2 dfpart2 38751 . 2 (∅ Part 𝐴 ↔ ( Disj ∅ ∧ (dom ∅ / ∅) = 𝐴))
3 dferALTV2 38650 . 2 ( ≀ ∅ ErALTV 𝐴 ↔ ( EqvRel ≀ ∅ ∧ (dom ≀ ∅ / ≀ ∅) = 𝐴))
41, 2, 33bitr4i 303 1 (∅ Part 𝐴 ↔ ≀ ∅ ErALTV 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1537  c0 4339  dom cdm 5689   / cqs 8743  ccoss 38162   EqvRel weqvrel 38179   ErALTV werALTV 38188   Disj wdisjALTV 38196   Part wpart 38201
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ral 3060  df-rex 3069  df-rmo 3378  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ec 8746  df-qs 8750  df-coss 38393  df-refrel 38494  df-cnvrefrel 38509  df-symrel 38526  df-trrel 38556  df-eqvrel 38567  df-dmqs 38621  df-erALTV 38646  df-disjALTV 38687  df-part 38748
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator