Theorem petidres 39671

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 39642. (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 39670	. 2 ⊢ (( Disj ( I ↾ 𝐴) ∧ (dom ( I ↾ 𝐴) / ( I ↾ 𝐴)) = 𝐴) ↔ ( EqvRel ≀ ( I ↾ 𝐴) ∧ (dom ≀ ( I ↾ 𝐴) / ≀ ( I ↾ 𝐴)) = 𝐴))
2		dfpart2 39621	. 2 ⊢ (( I ↾ 𝐴) Part 𝐴 ↔ ( Disj ( I ↾ 𝐴) ∧ (dom ( I ↾ 𝐴) / ( I ↾ 𝐴)) = 𝐴))
3		dferALTV2 39502	. 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 5549  dom cdm 5655   ↾ cres 5657   / cqs 8696   ≀ ccoss 38932   EqvRel weqvrel 38949   ErALTV werALTV 38958   Disj wdisjALTV 38968   Part wpart 38973

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rmo 3365  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ec 8699  df-qs 8703  df-coss 39250  df-refrel 39341  df-cnvrefrel 39356  df-symrel 39373  df-trrel 39407  df-eqvrel 39418  df-dmqs 39472  df-erALTV 39498  df-funALTV 39516  df-disjALTV 39539  df-part 39618

This theorem is used by: (None)