Theorem dfdisjALTV 39921

Description: Alternate definition of the disjoint relation predicate. A disjoint relation is a converse function of the relation, see the comment of df-disjs 39912 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 39913	. 2 ⊢ ( Disj 𝑅 ↔ ( CnvRefRel ≀ ◡𝑅 ∧ Rel 𝑅))
2		relcnv 6111	. . . 4 ⊢ Rel ◡𝑅
3		df-funALTV 39890	. . . 4 ⊢ ( FunALTV ◡𝑅 ↔ ( CnvRefRel ≀ ◡𝑅 ∧ Rel ◡𝑅))
4	2, 3	mpbiran2 723	. . 3 ⊢ ( FunALTV ◡𝑅 ↔ CnvRefRel ≀ ◡𝑅)
5	4	anbi1i 636	. 2 ⊢ (( FunALTV ◡𝑅 ∧ Rel 𝑅) ↔ ( CnvRefRel ≀ ◡𝑅 ∧ Rel 𝑅))
6	1, 5	bitr4i 281	1 ⊢ ( Disj 𝑅 ↔ ( FunALTV ◡𝑅 ∧ Rel 𝑅))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ^◡ccnv 5654  Rel wrel 5660   ≀ ccoss 39306   CnvRefRel wcnvrefrel 39315   FunALTV wfunALTV 39339   Disj wdisjALTV 39342

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663  df-funALTV 39890  df-disjALTV 39913

This theorem is used by:  disjqmap2  39949  disjss  39954