Theorem petidres 39631

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

Assertion

Ref	Expression
petidres	⊢ (( I ↾ 𝐴) Part 𝐴 ↔ ≀ ( I ↾ 𝐴) ErALTV 𝐴)

Proof of Theorem petidres

Step	Hyp	Ref	Expression
1		petidres2 39630	. 2 ⊢ (( Disj ( I ↾ 𝐴) ∧ (dom ( I ↾ 𝐴) / ( I ↾ 𝐴)) = 𝐴) ↔ ( EqvRel ≀ ( I ↾ 𝐴) ∧ (dom ≀ ( I ↾ 𝐴) / ≀ ( I ↾ 𝐴)) = 𝐴))
2		dfpart2 39581	. 2 ⊢ (( I ↾ 𝐴) Part 𝐴 ↔ ( Disj ( I ↾ 𝐴) ∧ (dom ( I ↾ 𝐴) / ( I ↾ 𝐴)) = 𝐴))
3		dferALTV2 39462	. 2 ⊢ ( ≀ ( I ↾ 𝐴) ErALTV 𝐴 ↔ ( EqvRel ≀ ( I ↾ 𝐴) ∧ (dom ≀ ( I ↾ 𝐴) / ≀ ( I ↾ 𝐴)) = 𝐴))
4	1, 2, 3	3bitr4i 306	1 ⊢ (( I ↾ 𝐴) Part 𝐴 ↔ ≀ ( I ↾ 𝐴) ErALTV 𝐴)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   I cid 5557  dom cdm 5663   ↾ cres 5665   / cqs 8699   ≀ ccoss 38892   EqvRel weqvrel 38909   ErALTV werALTV 38918   Disj wdisjALTV 38928   Part wpart 38933

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rmo 3371  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ec 8702  df-qs 8706  df-coss 39210  df-refrel 39301  df-cnvrefrel 39316  df-symrel 39333  df-trrel 39367  df-eqvrel 39378  df-dmqs 39432  df-erALTV 39458  df-funALTV 39476  df-disjALTV 39499  df-part 39578

This theorem is used by: (None)