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 38994
Description: Alternate definition of the disjoint relation predicate. A disjoint relation is a converse function of the relation, see the comment of df-disjs 38985 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 38986 . 2 ( Disj 𝑅 ↔ ( CnvRefRel ≀ 𝑅 ∧ Rel 𝑅))
2 relcnv 6063 . . . 4 Rel 𝑅
3 df-funALTV 38963 . . . 4 ( FunALTV 𝑅 ↔ ( CnvRefRel ≀ 𝑅 ∧ Rel 𝑅))
42, 3mpbiran2 710 . . 3 ( FunALTV 𝑅 ↔ CnvRefRel ≀ 𝑅)
54anbi1i 624 . 2 (( FunALTV 𝑅 ∧ Rel 𝑅) ↔ ( CnvRefRel ≀ 𝑅 ∧ Rel 𝑅))
61, 5bitr4i 278 1 ( Disj 𝑅 ↔ ( FunALTV 𝑅 ∧ Rel 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  ccnv 5623  Rel wrel 5629  ccoss 38386   CnvRefRel wcnvrefrel 38395   FunALTV wfunALTV 38417   Disj wdisjALTV 38420
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-v 3442  df-ss 3918  df-opab 5161  df-xp 5630  df-rel 5631  df-cnv 5632  df-funALTV 38963  df-disjALTV 38986
This theorem is referenced by:  disjss  39012
  Copyright terms: Public domain W3C validator