Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfdisjALTV Structured version   Visualization version   GIF version

Theorem dfdisjALTV 39371
Description: Alternate definition of the disjoint relation predicate. A disjoint relation is a converse function of the relation, see the comment of df-disjs 39362 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
StepHypRef Expression
1 df-disjALTV 39363 . 2 ( Disj 𝑅 ↔ ( CnvRefRel ≀ 𝑅 ∧ Rel 𝑅))
2 relcnv 6107 . . . 4 Rel 𝑅
3 df-funALTV 39340 . . . 4 ( FunALTV 𝑅 ↔ ( CnvRefRel ≀ 𝑅 ∧ Rel 𝑅))
42, 3mpbiran2 722 . . 3 ( FunALTV 𝑅 ↔ CnvRefRel ≀ 𝑅)
54anbi1i 635 . 2 (( FunALTV 𝑅 ∧ Rel 𝑅) ↔ ( CnvRefRel ≀ 𝑅 ∧ Rel 𝑅))
61, 5bitr4i 281 1 ( Disj 𝑅 ↔ ( FunALTV 𝑅 ∧ Rel 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400  ccnv 5661  Rel wrel 5667  ccoss 38756   CnvRefRel wcnvrefrel 38765   FunALTV wfunALTV 38789   Disj wdisjALTV 38792
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-v 3465  df-ss 3930  df-opab 5178  df-xp 5668  df-rel 5669  df-cnv 5670  df-funALTV 39340  df-disjALTV 39363
This theorem is referenced by:  disjqmap2  39399  disjss  39404
  Copyright terms: Public domain W3C validator