Theorem pet 39817

Description: Partition-Equivalence Theorem with general 𝑅 while preserving the restricted converse epsilon relation of mpet2 39806 (as opposed to petincnvepres 39815). A class is a partition by a range Cartesian product with general 𝑅 and the restricted converse element class if and only if the cosets by the range Cartesian product are in an equivalence relation on it. Cf. br1cossxrncnvepres 39394.

This theorem (together with pets 39818 and pet2 39816) is the main result of my investigation into set theory. It is no more general than the conventional Member Partition-Equivalence Theorem mpet 39805, mpet2 39806 and mpet3 39802 (because you cannot set 𝑅 in this theorem in such a way that you get mpet2 39806), i.e., it is not the hypothetical General Partition-Equivalence Theorem gpet ⊢ (𝑅 Part 𝐴 ↔ ≀ 𝑅 ErALTV 𝐴), but this one has a general part that mpet2 39806 lacks: 𝑅, which is sufficient for my future application of set theory, for my purpose outside of set theory. (Contributed by Peter Mazsa, 23-Sep-2021.)

Assertion

Ref	Expression
pet	⊢ ((𝑅 ⋉ (◡ E ↾ 𝐴)) Part 𝐴 ↔ ≀ (𝑅 ⋉ (◡ E ↾ 𝐴)) ErALTV 𝐴)

Proof of Theorem pet

Step	Hyp	Ref	Expression
1		pet2 39816	. 2 ⊢ (( Disj (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ (dom (𝑅 ⋉ (◡ E ↾ 𝐴)) / (𝑅 ⋉ (◡ E ↾ 𝐴))) = 𝐴) ↔ ( EqvRel ≀ (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ (dom ≀ (𝑅 ⋉ (◡ E ↾ 𝐴)) / ≀ (𝑅 ⋉ (◡ E ↾ 𝐴))) = 𝐴))
2		dfpart2 39724	. 2 ⊢ ((𝑅 ⋉ (◡ E ↾ 𝐴)) Part 𝐴 ↔ ( Disj (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ (dom (𝑅 ⋉ (◡ E ↾ 𝐴)) / (𝑅 ⋉ (◡ E ↾ 𝐴))) = 𝐴))
3		dferALTV2 39605	. 2 ⊢ ( ≀ (𝑅 ⋉ (◡ E ↾ 𝐴)) ErALTV 𝐴 ↔ ( EqvRel ≀ (𝑅 ⋉ (◡ E ↾ 𝐴)) ∧ (dom ≀ (𝑅 ⋉ (◡ E ↾ 𝐴)) / ≀ (𝑅 ⋉ (◡ E ↾ 𝐴))) = 𝐴))
4	1, 2, 3	3bitr4i 306	1 ⊢ ((𝑅 ⋉ (◡ E ↾ 𝐴)) Part 𝐴 ↔ ≀ (𝑅 ⋉ (◡ E ↾ 𝐴)) ErALTV 𝐴)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   E cep 5546  ^◡ccnv 5646  dom cdm 5647   ↾ cres 5649   / cqs 8694   ⋉ cxrn 39026   ≀ ccoss 39035   EqvRel weqvrel 39052   ErALTV werALTV 39061   Disj wdisjALTV 39071   Part wpart 39076

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 5248  ax-nul 5259  ax-pr 5390  ax-un 7734

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-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-eprel 5547  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fo 6533  df-fv 6535  df-1st 7984  df-2nd 7985  df-ec 8697  df-qs 8701  df-xrn 39232  df-coss 39353  df-refrel 39444  df-cnvrefrel 39459  df-symrel 39476  df-trrel 39510  df-eqvrel 39521  df-dmqs 39575  df-erALTV 39601  df-funALTV 39619  df-disjALTV 39642  df-eldisj 39644  df-part 39721

This theorem is used by:  pets  39818