Theorem dfdisjALTV 39475

Description: Alternate definition of the disjoint relation predicate. A disjoint relation is a converse function of the relation, see the comment of df-disjs 39466 why we need disjoint relations instead of converse functions anyway. (Contributed by Peter Mazsa, 27-Jul-2021.)

Assertion

Ref	Expression
dfdisjALTV	⊢ ( Disj 𝑅 ↔ ( FunALTV ◡𝑅 ∧ Rel 𝑅))

Proof of Theorem dfdisjALTV

Step	Hyp	Ref	Expression
1		df-disjALTV 39467	. 2 ⊢ ( Disj 𝑅 ↔ ( CnvRefRel ≀ ◡𝑅 ∧ Rel 𝑅))
2		relcnv 6106	. . . 4 ⊢ Rel ◡𝑅
3		df-funALTV 39444	. . . 4 ⊢ ( FunALTV ◡𝑅 ↔ ( CnvRefRel ≀ ◡𝑅 ∧ Rel ◡𝑅))
4	2, 3	mpbiran2 722	. . 3 ⊢ ( FunALTV ◡𝑅 ↔ CnvRefRel ≀ ◡𝑅)
5	4	anbi1i 635	. 2 ⊢ (( FunALTV ◡𝑅 ∧ Rel 𝑅) ↔ ( CnvRefRel ≀ ◡𝑅 ∧ Rel 𝑅))
6	1, 5	bitr4i 281	1 ⊢ ( Disj 𝑅 ↔ ( FunALTV ◡𝑅 ∧ Rel 𝑅))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400  ^◡ccnv 5660  Rel wrel 5666   ≀ ccoss 38860   CnvRefRel wcnvrefrel 38869   FunALTV wfunALTV 38893   Disj wdisjALTV 38896

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-ss 3922  df-opab 5174  df-xp 5667  df-rel 5668  df-cnv 5669  df-funALTV 39444  df-disjALTV 39467

This theorem is used by:  disjqmap2  39503  disjss  39508