ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fndmdif GIF version

Theorem fndmdif 5326
Description: Two ways to express the locus of differences between two functions. (Contributed by Stefan O'Rear, 17-Jan-2015.)
Assertion
Ref Expression
fndmdif ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom (𝐹𝐺) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)})
Distinct variable groups:   𝑥,𝐹   𝑥,𝐺   𝑥,𝐴

Proof of Theorem fndmdif
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 difss 3109 . . . . 5 (𝐹𝐺) ⊆ 𝐹
2 dmss 4583 . . . . 5 ((𝐹𝐺) ⊆ 𝐹 → dom (𝐹𝐺) ⊆ dom 𝐹)
31, 2ax-mp 7 . . . 4 dom (𝐹𝐺) ⊆ dom 𝐹
4 fndm 5050 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
54adantr 270 . . . 4 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom 𝐹 = 𝐴)
63, 5syl5sseq 3057 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom (𝐹𝐺) ⊆ 𝐴)
7 dfss1 3187 . . 3 (dom (𝐹𝐺) ⊆ 𝐴 ↔ (𝐴 ∩ dom (𝐹𝐺)) = dom (𝐹𝐺))
86, 7sylib 120 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐴 ∩ dom (𝐹𝐺)) = dom (𝐹𝐺))
9 vex 2614 . . . . 5 𝑥 ∈ V
109eldm 4581 . . . 4 (𝑥 ∈ dom (𝐹𝐺) ↔ ∃𝑦 𝑥(𝐹𝐺)𝑦)
11 eqcom 2085 . . . . . . . 8 ((𝐹𝑥) = (𝐺𝑥) ↔ (𝐺𝑥) = (𝐹𝑥))
12 fnbrfvb 5268 . . . . . . . 8 ((𝐺 Fn 𝐴𝑥𝐴) → ((𝐺𝑥) = (𝐹𝑥) ↔ 𝑥𝐺(𝐹𝑥)))
1311, 12syl5bb 190 . . . . . . 7 ((𝐺 Fn 𝐴𝑥𝐴) → ((𝐹𝑥) = (𝐺𝑥) ↔ 𝑥𝐺(𝐹𝑥)))
1413adantll 460 . . . . . 6 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → ((𝐹𝑥) = (𝐺𝑥) ↔ 𝑥𝐺(𝐹𝑥)))
1514necon3abid 2288 . . . . 5 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → ((𝐹𝑥) ≠ (𝐺𝑥) ↔ ¬ 𝑥𝐺(𝐹𝑥)))
16 funfvex 5245 . . . . . . . 8 ((Fun 𝐹𝑥 ∈ dom 𝐹) → (𝐹𝑥) ∈ V)
1716funfni 5051 . . . . . . 7 ((𝐹 Fn 𝐴𝑥𝐴) → (𝐹𝑥) ∈ V)
1817adantlr 461 . . . . . 6 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ V)
19 breq2 3810 . . . . . . . 8 (𝑦 = (𝐹𝑥) → (𝑥𝐺𝑦𝑥𝐺(𝐹𝑥)))
2019notbid 625 . . . . . . 7 (𝑦 = (𝐹𝑥) → (¬ 𝑥𝐺𝑦 ↔ ¬ 𝑥𝐺(𝐹𝑥)))
2120ceqsexgv 2733 . . . . . 6 ((𝐹𝑥) ∈ V → (∃𝑦(𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ ¬ 𝑥𝐺(𝐹𝑥)))
2218, 21syl 14 . . . . 5 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (∃𝑦(𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ ¬ 𝑥𝐺(𝐹𝑥)))
23 eqcom 2085 . . . . . . . . . 10 (𝑦 = (𝐹𝑥) ↔ (𝐹𝑥) = 𝑦)
24 fnbrfvb 5268 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑥𝐴) → ((𝐹𝑥) = 𝑦𝑥𝐹𝑦))
2523, 24syl5bb 190 . . . . . . . . 9 ((𝐹 Fn 𝐴𝑥𝐴) → (𝑦 = (𝐹𝑥) ↔ 𝑥𝐹𝑦))
2625adantlr 461 . . . . . . . 8 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (𝑦 = (𝐹𝑥) ↔ 𝑥𝐹𝑦))
2726anbi1d 453 . . . . . . 7 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → ((𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ (𝑥𝐹𝑦 ∧ ¬ 𝑥𝐺𝑦)))
28 brdif 3854 . . . . . . 7 (𝑥(𝐹𝐺)𝑦 ↔ (𝑥𝐹𝑦 ∧ ¬ 𝑥𝐺𝑦))
2927, 28syl6bbr 196 . . . . . 6 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → ((𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ 𝑥(𝐹𝐺)𝑦))
3029exbidv 1748 . . . . 5 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (∃𝑦(𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ ∃𝑦 𝑥(𝐹𝐺)𝑦))
3115, 22, 303bitr2rd 215 . . . 4 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (∃𝑦 𝑥(𝐹𝐺)𝑦 ↔ (𝐹𝑥) ≠ (𝐺𝑥)))
3210, 31syl5bb 190 . . 3 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (𝑥 ∈ dom (𝐹𝐺) ↔ (𝐹𝑥) ≠ (𝐺𝑥)))
3332rabbi2dva 3191 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐴 ∩ dom (𝐹𝐺)) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)})
348, 33eqtr3d 2117 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom (𝐹𝐺) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)})
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102  wb 103   = wceq 1285  wex 1422  wcel 1434  wne 2249  {crab 2357  Vcvv 2611  cdif 2980  cin 2982  wss 2983   class class class wbr 3806  dom cdm 4392   Fn wfn 4948  cfv 4953
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3917  ax-pow 3969  ax-pr 3993
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ne 2250  df-ral 2358  df-rex 2359  df-rab 2362  df-v 2613  df-sbc 2826  df-dif 2985  df-un 2987  df-in 2989  df-ss 2996  df-pw 3403  df-sn 3423  df-pr 3424  df-op 3426  df-uni 3623  df-br 3807  df-opab 3861  df-id 4077  df-xp 4398  df-rel 4399  df-cnv 4400  df-co 4401  df-dm 4402  df-iota 4918  df-fun 4955  df-fn 4956  df-fv 4961
This theorem is referenced by:  fndmdifcom  5327
  Copyright terms: Public domain W3C validator