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

Theorem fndmdifeq0 7034
Description: The difference set of two functions is empty if and only if the functions are equal. (Contributed by Stefan O'Rear, 17-Jan-2015.)
Assertion
Ref Expression
fndmdifeq0 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (dom (𝐹𝐺) = ∅ ↔ 𝐹 = 𝐺))

Proof of Theorem fndmdifeq0
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fndmdif 7032 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom (𝐹𝐺) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)})
21eqeq1d 2737 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (dom (𝐹𝐺) = ∅ ↔ {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅))
3 rabeq0 4363 . . . 4 ({𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅ ↔ ∀𝑥𝐴 ¬ (𝐹𝑥) ≠ (𝐺𝑥))
4 nne 2936 . . . . 5 (¬ (𝐹𝑥) ≠ (𝐺𝑥) ↔ (𝐹𝑥) = (𝐺𝑥))
54ralbii 3082 . . . 4 (∀𝑥𝐴 ¬ (𝐹𝑥) ≠ (𝐺𝑥) ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))
63, 5bitri 275 . . 3 ({𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅ ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))
7 eqfnfv 7021 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
86, 7bitr4id 290 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → ({𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅ ↔ 𝐹 = 𝐺))
92, 8bitrd 279 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (dom (𝐹𝐺) = ∅ ↔ 𝐹 = 𝐺))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1540  wne 2932  wral 3051  {crab 3415  cdif 3923  c0 4308  dom cdm 5654   Fn wfn 6526  cfv 6531
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-fv 6539
This theorem is referenced by:  wemapso  9565  wemapso2lem  9566
  Copyright terms: Public domain W3C validator