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 39998
Description: Alternate definition of the disjoint relation predicate. A disjoint relation is a converse function of the relation, see the comment of df-disjs 39989 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 39990 . 2 ( Disj 𝑅 ↔ ( CnvRefRel ≀ ◡𝑅 ∧ Rel 𝑅))
2 relcnv 6117 . . . 4 Rel ◡𝑅
3 df-funALTV 39967 . . . 4 ( FunALTV ◡𝑅 ↔ ( CnvRefRel ≀ ◡𝑅 ∧ Rel ◡𝑅))
42, 3mpbiran2 723 . . 3 ( FunALTV ◡𝑅 ↔ CnvRefRel ≀ ◡𝑅)
54anbi1i 636 . 2 (( FunALTV ◡𝑅 ∧ Rel 𝑅) ↔ ( CnvRefRel ≀ ◡𝑅 ∧ Rel 𝑅))
61, 5bitr4i 281 1 ( Disj 𝑅 ↔ ( FunALTV ◡𝑅 ∧ Rel 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ◡ccnv 5656  Rel wrel 5662   ≀ ccoss 39383   CnvRefRel wcnvrefrel 39392   FunALTV wfunALTV 39416   Disj wdisjALTV 39419
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-opab 5173  df-xp 5663  df-rel 5664  df-cnv 5665  df-funALTV 39967  df-disjALTV 39990
This theorem is used by:  disjqmap2  40026  disjss  40031
  Copyright terms: Public domain W3C validator