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

Theorem petid 39171
Description: A class is a partition by the identity class if and only if the cosets by the identity class are in equivalence relation on it. (Contributed by Peter Mazsa, 31-Dec-2021.)
Assertion
Ref Expression
petid ( I Part 𝐴 ↔ ≀ I ErALTV 𝐴)

Proof of Theorem petid
StepHypRef Expression
1 petid2 39170 . 2 (( Disj I ∧ (dom I / I ) = 𝐴) ↔ ( EqvRel ≀ I ∧ (dom ≀ I / ≀ I ) = 𝐴))
2 dfpart2 39123 . 2 ( I Part 𝐴 ↔ ( Disj I ∧ (dom I / I ) = 𝐴))
3 dferALTV2 39004 . 2 ( ≀ I ErALTV 𝐴 ↔ ( EqvRel ≀ I ∧ (dom ≀ I / ≀ I ) = 𝐴))
41, 2, 33bitr4i 303 1 ( I Part 𝐴 ↔ ≀ I ErALTV 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1542   I cid 5526  dom cdm 5632   / cqs 8644  ccoss 38434   EqvRel weqvrel 38451   ErALTV werALTV 38460   Disj wdisjALTV 38470   Part wpart 38475
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 2709  ax-sep 5243  ax-pr 5379
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rmo 3352  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-ec 8647  df-qs 8651  df-coss 38752  df-refrel 38843  df-cnvrefrel 38858  df-symrel 38875  df-trrel 38909  df-eqvrel 38920  df-dmqs 38974  df-erALTV 39000  df-disjALTV 39041  df-part 39120
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator