Theorem disjim 39566

Description: The "Divide et Aequivalere" Theorem: every disjoint relation generates equivalent cosets by the relation: generalization of the former prter1 39686, cf. eldisjim 39569. (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 39483	. . . 4 ⊢ ( Disj 𝑅 ↔ (∀𝑦∃*𝑢 𝑢𝑅𝑦 ∧ Rel 𝑅))
2	1	simplbi 502	. . 3 ⊢ ( Disj 𝑅 → ∀𝑦∃*𝑢 𝑢𝑅𝑦)
3		trcoss 39254	. . 3 ⊢ (∀𝑦∃*𝑢 𝑢𝑅𝑦 → ∀𝑥∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧))
4	2, 3	syl 18	. 2 ⊢ ( Disj 𝑅 → ∀𝑥∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧))
5		eqvrelcoss3 39384	. 2 ⊢ ( EqvRel ≀ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥 ≀ 𝑅𝑦 ∧ 𝑦 ≀ 𝑅𝑧) → 𝑥 ≀ 𝑅𝑧))
6	4, 5	sylibr 237	1 ⊢ ( Disj 𝑅 → EqvRel ≀ 𝑅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568  ∃*wmo 2567   class class class wbr 5111  Rel wrel 5668   ≀ ccoss 38865   EqvRel weqvrel 38882   Disj wdisjALTV 38901

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-coss 39183  df-refrel 39274  df-cnvrefrel 39289  df-symrel 39306  df-trrel 39340  df-eqvrel 39351  df-disjALTV 39472

This theorem is used by:  disjimi  39567  detlem  39568  eldisjim  39569  eldisjim2  39570  partim2  39592  disjimeldisjdmqs  39615