Theorem disjim 39923

Description: The "Divide et Aequivalere" Theorem: every disjoint relation generates equivalent cosets by the relation: generalization of the former prter1 40043, cf. eldisjim 39926. (Contributed by Peter Mazsa, 3-May-2019.) (Revised by Peter Mazsa, 17-Sep-2021.)

Assertion

Ref	Expression
disjim	⊢ ( Disj 𝑅 → EqvRel ≀ 𝑅)

Proof of Theorem disjim

Dummy variables 𝑢 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfdisjALTV4 39840	. . . 4 ⊢ ( Disj 𝑅 ↔ (∀𝑦∃*𝑢 𝑢𝑅𝑦 ∧ Rel 𝑅))
2	1	simplbi 502	. . 3 ⊢ ( Disj 𝑅 → ∀𝑦∃*𝑢 𝑢𝑅𝑦)
3		trcoss 39611	. . 3 ⊢ (∀𝑦∃*𝑢 𝑢𝑅𝑦 → ∀𝑥∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧))
4	2, 3	syl 18	. 2 ⊢ ( Disj 𝑅 → ∀𝑥∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧))
5		eqvrelcoss3 39741	. 2 ⊢ ( EqvRel ≀ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧))
6	4, 5	sylibr 237	1 ⊢ ( Disj 𝑅 → EqvRel ≀ 𝑅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567  ∃*wmo 2562   class class class wbr 5102  Rel wrel 5655   ≀ ccoss 39222   EqvRel weqvrel 39239   Disj wdisjALTV 39258

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-coss 39540  df-refrel 39631  df-cnvrefrel 39646  df-symrel 39663  df-trrel 39697  df-eqvrel 39708  df-disjALTV 39829

This theorem is used by:  disjimi  39924  detlem  39925  eldisjim  39926  eldisjim2  39927  partim2  39949  disjimeldisjdmqs  39972