Theorem fences 37714

Description: The Theorem of Fences by Equivalences: all conceivable equivalence relations (besides the comember equivalence relation cf. mpet 37709) generate a partition of the members. (Contributed by Peter Mazsa, 26-Sep-2021.)

Assertion

Ref	Expression
fences	⊢ (𝑅 ErALTV 𝐴 → MembPart 𝐴)

Proof of Theorem fences

Step	Hyp	Ref	Expression
1		mainer 37704	. 2 ⊢ (𝑅 ErALTV 𝐴 → CoMembEr 𝐴)
2		mpet 37709	. 2 ⊢ ( MembPart 𝐴 ↔ CoMembEr 𝐴)
3	1, 2	sylibr 233	1 ⊢ (𝑅 ErALTV 𝐴 → MembPart 𝐴)

Syntax hints:   → wi 4   ErALTV werALTV 37069   CoMembEr wcomember 37071   MembPart wmembpart 37084

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-id 5575  df-eprel 5581  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-ec 8705  df-qs 8709  df-coss 37281  df-coels 37282  df-refrel 37382  df-cnvrefrel 37397  df-symrel 37414  df-trrel 37444  df-eqvrel 37455  df-coeleqvrel 37457  df-dmqs 37509  df-erALTV 37534  df-comember 37536  df-funALTV 37552  df-disjALTV 37575  df-eldisj 37577  df-part 37636  df-membpart 37638

This theorem is referenced by:  fences2  37715