Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  suppvalbr Structured version   Visualization version   GIF version

Theorem suppvalbr 7817
 Description: The value of the operation constructing the support of a function expressed by binary relations. (Contributed by AV, 7-Apr-2019.)
Assertion
Ref Expression
suppvalbr ((𝑅𝑉𝑍𝑊) → (𝑅 supp 𝑍) = {𝑥 ∣ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦𝑦𝑍))})
Distinct variable groups:   𝑥,𝑅,𝑦   𝑥,𝑍,𝑦
Allowed substitution hints:   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem suppvalbr
StepHypRef Expression
1 suppval 7815 . 2 ((𝑅𝑉𝑍𝑊) → (𝑅 supp 𝑍) = {𝑥 ∈ dom 𝑅 ∣ (𝑅 “ {𝑥}) ≠ {𝑍}})
2 df-rab 3115 . . . 4 {𝑥 ∈ dom 𝑅 ∣ (𝑅 “ {𝑥}) ≠ {𝑍}} = {𝑥 ∣ (𝑥 ∈ dom 𝑅 ∧ (𝑅 “ {𝑥}) ≠ {𝑍})}
3 vex 3444 . . . . . . 7 𝑥 ∈ V
43eldm 5733 . . . . . 6 (𝑥 ∈ dom 𝑅 ↔ ∃𝑦 𝑥𝑅𝑦)
5 df-sn 4526 . . . . . . . 8 {𝑍} = {𝑦𝑦 = 𝑍}
65neeq2i 3052 . . . . . . 7 ({𝑦𝑥𝑅𝑦} ≠ {𝑍} ↔ {𝑦𝑥𝑅𝑦} ≠ {𝑦𝑦 = 𝑍})
7 imasng 5918 . . . . . . . . 9 (𝑥 ∈ V → (𝑅 “ {𝑥}) = {𝑦𝑥𝑅𝑦})
87elv 3446 . . . . . . . 8 (𝑅 “ {𝑥}) = {𝑦𝑥𝑅𝑦}
98neeq1i 3051 . . . . . . 7 ((𝑅 “ {𝑥}) ≠ {𝑍} ↔ {𝑦𝑥𝑅𝑦} ≠ {𝑍})
10 nabbi 3089 . . . . . . 7 (∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍) ↔ {𝑦𝑥𝑅𝑦} ≠ {𝑦𝑦 = 𝑍})
116, 9, 103bitr4i 306 . . . . . 6 ((𝑅 “ {𝑥}) ≠ {𝑍} ↔ ∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍))
124, 11anbi12i 629 . . . . 5 ((𝑥 ∈ dom 𝑅 ∧ (𝑅 “ {𝑥}) ≠ {𝑍}) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍)))
1312abbii 2863 . . . 4 {𝑥 ∣ (𝑥 ∈ dom 𝑅 ∧ (𝑅 “ {𝑥}) ≠ {𝑍})} = {𝑥 ∣ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍))}
142, 13eqtri 2821 . . 3 {𝑥 ∈ dom 𝑅 ∣ (𝑅 “ {𝑥}) ≠ {𝑍}} = {𝑥 ∣ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍))}
1514a1i 11 . 2 ((𝑅𝑉𝑍𝑊) → {𝑥 ∈ dom 𝑅 ∣ (𝑅 “ {𝑥}) ≠ {𝑍}} = {𝑥 ∣ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍))})
16 df-ne 2988 . . . . . . . 8 (𝑦𝑍 ↔ ¬ 𝑦 = 𝑍)
1716bicomi 227 . . . . . . 7 𝑦 = 𝑍𝑦𝑍)
1817bibi2i 341 . . . . . 6 ((𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍) ↔ (𝑥𝑅𝑦𝑦𝑍))
1918exbii 1849 . . . . 5 (∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍) ↔ ∃𝑦(𝑥𝑅𝑦𝑦𝑍))
2019anbi2i 625 . . . 4 ((∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍)) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦𝑦𝑍)))
2120abbii 2863 . . 3 {𝑥 ∣ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍))} = {𝑥 ∣ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦𝑦𝑍))}
2221a1i 11 . 2 ((𝑅𝑉𝑍𝑊) → {𝑥 ∣ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦 ↔ ¬ 𝑦 = 𝑍))} = {𝑥 ∣ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦𝑦𝑍))})
231, 15, 223eqtrd 2837 1 ((𝑅𝑉𝑍𝑊) → (𝑅 supp 𝑍) = {𝑥 ∣ (∃𝑦 𝑥𝑅𝑦 ∧ ∃𝑦(𝑥𝑅𝑦𝑦𝑍))})
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538  ∃wex 1781   ∈ wcel 2111  {cab 2776   ≠ wne 2987  {crab 3110  Vcvv 3441  {csn 4525   class class class wbr 5030  dom cdm 5519   “ cima 5522  (class class class)co 7135   supp csupp 7813 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 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295  ax-un 7441 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-supp 7814 This theorem is referenced by:  suppimacnvss  7823  suppimacnv  7824
 Copyright terms: Public domain W3C validator