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

Theorem dfeldisj5 39503
Description: Alternate definition of the disjoint elementhood predicate. (Contributed by Peter Mazsa, 19-Sep-2021.)
Assertion
Ref Expression
dfeldisj5 ( ElDisj 𝐴 ↔ ∀𝑢𝐴𝑣𝐴 (𝑢 = 𝑣 ∨ (𝑢𝑣) = ∅))
Distinct variable group:   𝑢,𝐴,𝑣

Proof of Theorem dfeldisj5
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 dfeldisj4 39502 . 2 ( ElDisj 𝐴 ↔ ∀𝑥∃*𝑢𝐴 𝑥𝑢)
2 inecmo2 39046 . . . 4 ((∀𝑢𝐴𝑣𝐴 (𝑢 = 𝑣 ∨ ([𝑢] E ∩ [𝑣] E ) = ∅) ∧ Rel E ) ↔ (∀𝑥∃*𝑢𝐴 𝑢 E 𝑥 ∧ Rel E ))
3 relcnv 6111 . . . . 5 Rel E
43biantru 539 . . . 4 (∀𝑢𝐴𝑣𝐴 (𝑢 = 𝑣 ∨ ([𝑢] E ∩ [𝑣] E ) = ∅) ↔ (∀𝑢𝐴𝑣𝐴 (𝑢 = 𝑣 ∨ ([𝑢] E ∩ [𝑣] E ) = ∅) ∧ Rel E ))
53biantru 539 . . . 4 (∀𝑥∃*𝑢𝐴 𝑢 E 𝑥 ↔ (∀𝑥∃*𝑢𝐴 𝑢 E 𝑥 ∧ Rel E ))
62, 4, 53bitr4i 306 . . 3 (∀𝑢𝐴𝑣𝐴 (𝑢 = 𝑣 ∨ ([𝑢] E ∩ [𝑣] E ) = ∅) ↔ ∀𝑥∃*𝑢𝐴 𝑢 E 𝑥)
7 eccnvep 38978 . . . . . . . 8 (𝑢 ∈ V → [𝑢] E = 𝑢)
87elv 3463 . . . . . . 7 [𝑢] E = 𝑢
9 eccnvep 38978 . . . . . . . 8 (𝑣 ∈ V → [𝑣] E = 𝑣)
109elv 3463 . . . . . . 7 [𝑣] E = 𝑣
118, 10ineq12i 4174 . . . . . 6 ([𝑢] E ∩ [𝑣] E ) = (𝑢𝑣)
1211eqeq1i 2771 . . . . 5 (([𝑢] E ∩ [𝑣] E ) = ∅ ↔ (𝑢𝑣) = ∅)
1312orbi2i 926 . . . 4 ((𝑢 = 𝑣 ∨ ([𝑢] E ∩ [𝑣] E ) = ∅) ↔ (𝑢 = 𝑣 ∨ (𝑢𝑣) = ∅))
14132ralbii 3143 . . 3 (∀𝑢𝐴𝑣𝐴 (𝑢 = 𝑣 ∨ ([𝑢] E ∩ [𝑣] E ) = ∅) ↔ ∀𝑢𝐴𝑣𝐴 (𝑢 = 𝑣 ∨ (𝑢𝑣) = ∅))
15 brcnvep 38960 . . . . . 6 (𝑢 ∈ V → (𝑢 E 𝑥𝑥𝑢))
1615elv 3463 . . . . 5 (𝑢 E 𝑥𝑥𝑢)
1716rmobii 3380 . . . 4 (∃*𝑢𝐴 𝑢 E 𝑥 ↔ ∃*𝑢𝐴 𝑥𝑢)
1817albii 1852 . . 3 (∀𝑥∃*𝑢𝐴 𝑢 E 𝑥 ↔ ∀𝑥∃*𝑢𝐴 𝑥𝑢)
196, 14, 183bitr3i 304 . 2 (∀𝑢𝐴𝑣𝐴 (𝑢 = 𝑣 ∨ (𝑢𝑣) = ∅) ↔ ∀𝑥∃*𝑢𝐴 𝑥𝑢)
201, 19bitr4i 281 1 ( ElDisj 𝐴 ↔ ∀𝑢𝐴𝑣𝐴 (𝑢 = 𝑣 ∨ (𝑢𝑣) = ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 401  wo 861  wal 1568   = wceq 1570  wral 3082  ∃*wrmo 3371  Vcvv 3458  cin 3907  c0 4289   class class class wbr 5114   E cep 5565  ccnv 5665  Rel wrel 5671  [cec 8701   ElDisj weldisj 38911
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-pr 5409
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-id 5561  df-eprel 5566  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-ec 8705  df-coss 39191  df-cnvrefrel 39297  df-disjALTV 39480  df-eldisj 39482
This theorem is used by:  dfeldisj5a  39504  eqvreldisj2  39618
  Copyright terms: Public domain W3C validator