Theorem petidres2 38318

Description: Class 𝐴 is a partition by the identity class restricted to it if and only if the cosets by the restricted identity class are in equivalence relation on it. (Contributed by Peter Mazsa, 31-Dec-2021.)

Assertion

Ref	Expression
petidres2	⊢ (( Disj ( I ↾ 𝐴) ∧ (dom ( I ↾ 𝐴) / ( I ↾ 𝐴)) = 𝐴) ↔ ( EqvRel ≀ ( I ↾ 𝐴) ∧ (dom ≀ ( I ↾ 𝐴) / ≀ ( I ↾ 𝐴)) = 𝐴))

Proof of Theorem petidres2

Step	Hyp	Ref	Expression
1		disjALTVidres 38256	. 2 ⊢ Disj ( I ↾ 𝐴)
2	1	petlemi 38313	1 ⊢ (( Disj ( I ↾ 𝐴) ∧ (dom ( I ↾ 𝐴) / ( I ↾ 𝐴)) = 𝐴) ↔ ( EqvRel ≀ ( I ↾ 𝐴) ∧ (dom ≀ ( I ↾ 𝐴) / ≀ ( I ↾ 𝐴)) = 𝐴))

Syntax hints:   ↔ wb 205   ∧ wa 394   = wceq 1533   I cid 5567  dom cdm 5670   ↾ cres 5672   / cqs 8720   ≀ ccoss 37677   EqvRel weqvrel 37694   Disj wdisjALTV 37711

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5292  ax-nul 5299  ax-pr 5421

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ral 3052  df-rex 3061  df-rmo 3364  df-rab 3420  df-v 3465  df-dif 3942  df-un 3944  df-in 3946  df-ss 3956  df-nul 4317  df-if 4523  df-sn 4623  df-pr 4625  df-op 4629  df-br 5142  df-opab 5204  df-id 5568  df-xp 5676  df-rel 5677  df-cnv 5678  df-co 5679  df-dm 5680  df-rn 5681  df-res 5682  df-ima 5683  df-ec 8723  df-qs 8727  df-coss 37911  df-refrel 38012  df-cnvrefrel 38027  df-symrel 38044  df-trrel 38074  df-eqvrel 38085  df-funALTV 38182  df-disjALTV 38205

This theorem is referenced by:  petidres  38319