Theorem fences2 39396

Description: The Theorem of Fences by Equivalences: all conceivable equivalence relations (besides the comember equivalence relation cf. mpet3 39387) generate a partition of the members, it alo means that (𝑅 ErALTV 𝐴 → ElDisj 𝐴) and that (𝑅 ErALTV 𝐴 → ¬ ∅ ∈ 𝐴). (Contributed by Peter Mazsa, 15-Oct-2021.)

Assertion

Ref	Expression
fences2	⊢ (𝑅 ErALTV 𝐴 → ( ElDisj 𝐴 ∧ ¬ ∅ ∈ 𝐴))

Proof of Theorem fences2

Step	Hyp	Ref	Expression
1		fences 39395	. 2 ⊢ (𝑅 ErALTV 𝐴 → MembPart 𝐴)
2		dfmembpart2 39310	. 2 ⊢ ( MembPart 𝐴 ↔ ( ElDisj 𝐴 ∧ ¬ ∅ ∈ 𝐴))
3	1, 2	sylib 220	1 ⊢ (𝑅 ErALTV 𝐴 → ( ElDisj 𝐴 ∧ ¬ ∅ ∈ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   ∈ wcel 2132  ∅c0 4276   ErALTV werALTV 38646   ElDisj weldisj 38658   MembPart wmembpart 38663

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-sep 5236  ax-nul 5246  ax-pr 5380

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-rmo 3357  df-rab 3405  df-v 3446  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-br 5091  df-opab 5153  df-id 5531  df-eprel 5536  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-ec 8664  df-qs 8668  df-coss 38938  df-coels 38939  df-refrel 39029  df-cnvrefrel 39044  df-symrel 39061  df-trrel 39095  df-eqvrel 39106  df-coeleqvrel 39108  df-dmqs 39160  df-erALTV 39186  df-comember 39188  df-funALTV 39204  df-disjALTV 39227  df-eldisj 39229  df-part 39306  df-membpart 39308

This theorem is referenced by:  mainer2  39397