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

Theorem fndmdifeq0 7040
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 7038 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom (𝐹𝐺) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)})
21eqeq1d 2771 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (dom (𝐹𝐺) = ∅ ↔ {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅))
3 rabeq0 4352 . . . 4 ({𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅ ↔ ∀𝑥𝐴 ¬ (𝐹𝑥) ≠ (𝐺𝑥))
4 nne 2968 . . . . 5 (¬ (𝐹𝑥) ≠ (𝐺𝑥) ↔ (𝐹𝑥) = (𝐺𝑥))
54ralbii 3117 . . . 4 (∀𝑥𝐴 ¬ (𝐹𝑥) ≠ (𝐺𝑥) ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))
63, 5bitri 278 . . 3 ({𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)} = ∅ ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))
7 eqfnfv 7026 . . 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 1567  wne 2964  wral 3085  {crab 3423  cdif 3910  c0 4294  dom cdm 5662   Fn wfn 6532  cfv 6537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545
This theorem is referenced by:  wemapso  9512  wemapso2lem  9513
  Copyright terms: Public domain W3C validator