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

Theorem fndmdifeq0 7039
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 7037 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom (𝐹𝐺) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)})
21eqeq1d 2765 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (dom (𝐹𝐺) = ∅ ↔ {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅))
3 rabeq0 4345 . . . 4 ({𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅ ↔ ∀𝑥𝐴 ¬ (𝐹𝑥) ≠ (𝐺𝑥))
4 nne 2962 . . . . 5 (¬ (𝐹𝑥) ≠ (𝐺𝑥) ↔ (𝐹𝑥) = (𝐺𝑥))
54ralbii 3111 . . . 4 (∀𝑥𝐴 ¬ (𝐹𝑥) ≠ (𝐺𝑥) ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))
63, 5bitri 278 . . 3 ({𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅ ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))
7 eqfnfv 7025 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
86, 7bitr4id 293 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → ({𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅ ↔ 𝐹 = 𝐺))
92, 8bitrd 282 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (dom (𝐹𝐺) = ∅ ↔ 𝐹 = 𝐺))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400   = wceq 1570  wne 2958  wral 3079  {crab 3416  cdif 3902  c0 4286  dom cdm 5661   Fn wfn 6531  cfv 6536
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-fv 6544
This theorem is referenced by:  wemapso  9509  wemapso2lem  9510
  Copyright terms: Public domain W3C validator