Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfint3 Structured version   Visualization version   GIF version

Theorem dfint3 33838
Description: Quantifier-free definition of class intersection. (Contributed by Scott Fenton, 13-Apr-2018.)
Assertion
Ref Expression
dfint3 𝐴 = (V ∖ ((V ∖ E ) “ 𝐴))

Proof of Theorem dfint3
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfint2 4843 . 2 𝐴 = {𝑥 ∣ ∀𝑦𝐴 𝑥𝑦}
2 ralnex 3163 . . . 4 (∀𝑦𝐴 ¬ 𝑦(V ∖ E )𝑥 ↔ ¬ ∃𝑦𝐴 𝑦(V ∖ E )𝑥)
3 vex 3413 . . . . . . . . 9 𝑦 ∈ V
4 vex 3413 . . . . . . . . 9 𝑥 ∈ V
53, 4brcnv 5728 . . . . . . . 8 (𝑦(V ∖ E )𝑥𝑥(V ∖ E )𝑦)
6 brv 5336 . . . . . . . . 9 𝑥V𝑦
7 brdif 5089 . . . . . . . . 9 (𝑥(V ∖ E )𝑦 ↔ (𝑥V𝑦 ∧ ¬ 𝑥 E 𝑦))
86, 7mpbiran 708 . . . . . . . 8 (𝑥(V ∖ E )𝑦 ↔ ¬ 𝑥 E 𝑦)
95, 8bitr2i 279 . . . . . . 7 𝑥 E 𝑦𝑦(V ∖ E )𝑥)
109con1bii 360 . . . . . 6 𝑦(V ∖ E )𝑥𝑥 E 𝑦)
11 epel 5442 . . . . . 6 (𝑥 E 𝑦𝑥𝑦)
1210, 11bitr2i 279 . . . . 5 (𝑥𝑦 ↔ ¬ 𝑦(V ∖ E )𝑥)
1312ralbii 3097 . . . 4 (∀𝑦𝐴 𝑥𝑦 ↔ ∀𝑦𝐴 ¬ 𝑦(V ∖ E )𝑥)
14 eldif 3870 . . . . . 6 (𝑥 ∈ (V ∖ ((V ∖ E ) “ 𝐴)) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ ((V ∖ E ) “ 𝐴)))
154, 14mpbiran 708 . . . . 5 (𝑥 ∈ (V ∖ ((V ∖ E ) “ 𝐴)) ↔ ¬ 𝑥 ∈ ((V ∖ E ) “ 𝐴))
164elima 5911 . . . . 5 (𝑥 ∈ ((V ∖ E ) “ 𝐴) ↔ ∃𝑦𝐴 𝑦(V ∖ E )𝑥)
1715, 16xchbinx 337 . . . 4 (𝑥 ∈ (V ∖ ((V ∖ E ) “ 𝐴)) ↔ ¬ ∃𝑦𝐴 𝑦(V ∖ E )𝑥)
182, 13, 173bitr4ri 307 . . 3 (𝑥 ∈ (V ∖ ((V ∖ E ) “ 𝐴)) ↔ ∀𝑦𝐴 𝑥𝑦)
1918abbi2i 2891 . 2 (V ∖ ((V ∖ E ) “ 𝐴)) = {𝑥 ∣ ∀𝑦𝐴 𝑥𝑦}
201, 19eqtr4i 2784 1 𝐴 = (V ∖ ((V ∖ E ) “ 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1538  wcel 2111  {cab 2735  wral 3070  wrex 3071  Vcvv 3409  cdif 3857   cint 4841   class class class wbr 5036   E cep 5438  ccnv 5527  cima 5531
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-sep 5173  ax-nul 5180  ax-pr 5302
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-v 3411  df-dif 3863  df-un 3865  df-in 3867  df-nul 4228  df-if 4424  df-sn 4526  df-pr 4528  df-op 4532  df-int 4842  df-br 5037  df-opab 5099  df-eprel 5439  df-xp 5534  df-cnv 5536  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator