Theorem mpet2 39095

Description: Member Partition-Equivalence Theorem in a shorter form. Together with mpet 39094 mpet3 39091, mostly in its conventional cpet 39093 and cpet2 39092 form, this is what we used to think of as the partition equivalence theorem (but cf. pet2 39105 with general 𝑅). (Contributed by Peter Mazsa, 24-Sep-2021.)

Assertion

Ref	Expression
mpet2	⊢ ((◡ E ↾ 𝐴) Part 𝐴 ↔ ≀ (◡ E ↾ 𝐴) ErALTV 𝐴)

Proof of Theorem mpet2

Step	Hyp	Ref	Expression
1		mpet 39094	. 2 ⊢ ( MembPart 𝐴 ↔ CoMembEr 𝐴)
2		df-membpart 39023	. 2 ⊢ ( MembPart 𝐴 ↔ (◡ E ↾ 𝐴) Part 𝐴)
3		df-comember 38921	. 2 ⊢ ( CoMembEr 𝐴 ↔ ≀ (◡ E ↾ 𝐴) ErALTV 𝐴)
4	1, 2, 3	3bitr3i 301	1 ⊢ ((◡ E ↾ 𝐴) Part 𝐴 ↔ ≀ (◡ E ↾ 𝐴) ErALTV 𝐴)

Syntax hints:   ↔ wb 206   E cep 5523  ^◡ccnv 5623   ↾ cres 5626   ≀ ccoss 38379   ErALTV werALTV 38405   CoMembEr wcomember 38407   Part wpart 38418   MembPart wmembpart 38420

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-id 5519  df-eprel 5524  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ec 8637  df-qs 8641  df-coss 38670  df-coels 38671  df-refrel 38761  df-cnvrefrel 38776  df-symrel 38793  df-trrel 38827  df-eqvrel 38838  df-coeleqvrel 38840  df-dmqs 38892  df-erALTV 38919  df-comember 38921  df-funALTV 38937  df-disjALTV 38960  df-eldisj 38962  df-part 39021  df-membpart 39023

This theorem is referenced by:  mpets2  39096