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

Theorem fndmdif 5761
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 3335 . . . . 5 (𝐹𝐺) ⊆ 𝐹
2 dmss 4936 . . . . 5 ((𝐹𝐺) ⊆ 𝐹 → dom (𝐹𝐺) ⊆ dom 𝐹)
31, 2ax-mp 5 . . . 4 dom (𝐹𝐺) ⊆ dom 𝐹
4 fndm 5436 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
54adantr 276 . . . 4 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom 𝐹 = 𝐴)
63, 5sseqtrid 3278 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom (𝐹𝐺) ⊆ 𝐴)
7 dfss1 3413 . . 3 (dom (𝐹𝐺) ⊆ 𝐴 ↔ (𝐴 ∩ dom (𝐹𝐺)) = dom (𝐹𝐺))
86, 7sylib 122 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐴 ∩ dom (𝐹𝐺)) = dom (𝐹𝐺))
9 vex 2806 . . . . 5 𝑥 ∈ V
109eldm 4934 . . . 4 (𝑥 ∈ dom (𝐹𝐺) ↔ ∃𝑦 𝑥(𝐹𝐺)𝑦)
11 eqcom 2233 . . . . . . . 8 ((𝐹𝑥) = (𝐺𝑥) ↔ (𝐺𝑥) = (𝐹𝑥))
12 fnbrfvb 5693 . . . . . . . 8 ((𝐺 Fn 𝐴𝑥𝐴) → ((𝐺𝑥) = (𝐹𝑥) ↔ 𝑥𝐺(𝐹𝑥)))
1311, 12bitrid 192 . . . . . . 7 ((𝐺 Fn 𝐴𝑥𝐴) → ((𝐹𝑥) = (𝐺𝑥) ↔ 𝑥𝐺(𝐹𝑥)))
1413adantll 476 . . . . . 6 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → ((𝐹𝑥) = (𝐺𝑥) ↔ 𝑥𝐺(𝐹𝑥)))
1514necon3abid 2442 . . . . 5 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → ((𝐹𝑥) ≠ (𝐺𝑥) ↔ ¬ 𝑥𝐺(𝐹𝑥)))
16 funfvex 5665 . . . . . . . 8 ((Fun 𝐹𝑥 ∈ dom 𝐹) → (𝐹𝑥) ∈ V)
1716funfni 5439 . . . . . . 7 ((𝐹 Fn 𝐴𝑥𝐴) → (𝐹𝑥) ∈ V)
1817adantlr 477 . . . . . 6 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ V)
19 breq2 4097 . . . . . . . 8 (𝑦 = (𝐹𝑥) → (𝑥𝐺𝑦𝑥𝐺(𝐹𝑥)))
2019notbid 673 . . . . . . 7 (𝑦 = (𝐹𝑥) → (¬ 𝑥𝐺𝑦 ↔ ¬ 𝑥𝐺(𝐹𝑥)))
2120ceqsexgv 2936 . . . . . 6 ((𝐹𝑥) ∈ V → (∃𝑦(𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ ¬ 𝑥𝐺(𝐹𝑥)))
2218, 21syl 14 . . . . 5 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (∃𝑦(𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ ¬ 𝑥𝐺(𝐹𝑥)))
23 eqcom 2233 . . . . . . . . . 10 (𝑦 = (𝐹𝑥) ↔ (𝐹𝑥) = 𝑦)
24 fnbrfvb 5693 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝑥𝐴) → ((𝐹𝑥) = 𝑦𝑥𝐹𝑦))
2523, 24bitrid 192 . . . . . . . . 9 ((𝐹 Fn 𝐴𝑥𝐴) → (𝑦 = (𝐹𝑥) ↔ 𝑥𝐹𝑦))
2625adantlr 477 . . . . . . . 8 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (𝑦 = (𝐹𝑥) ↔ 𝑥𝐹𝑦))
2726anbi1d 465 . . . . . . 7 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → ((𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ (𝑥𝐹𝑦 ∧ ¬ 𝑥𝐺𝑦)))
28 brdif 4147 . . . . . . 7 (𝑥(𝐹𝐺)𝑦 ↔ (𝑥𝐹𝑦 ∧ ¬ 𝑥𝐺𝑦))
2927, 28bitr4di 198 . . . . . 6 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → ((𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ 𝑥(𝐹𝐺)𝑦))
3029exbidv 1873 . . . . 5 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (∃𝑦(𝑦 = (𝐹𝑥) ∧ ¬ 𝑥𝐺𝑦) ↔ ∃𝑦 𝑥(𝐹𝐺)𝑦))
3115, 22, 303bitr2rd 217 . . . 4 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (∃𝑦 𝑥(𝐹𝐺)𝑦 ↔ (𝐹𝑥) ≠ (𝐺𝑥)))
3210, 31bitrid 192 . . 3 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ 𝑥𝐴) → (𝑥 ∈ dom (𝐹𝐺) ↔ (𝐹𝑥) ≠ (𝐺𝑥)))
3332rabbi2dva 3417 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐴 ∩ dom (𝐹𝐺)) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)})
348, 33eqtr3d 2266 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → dom (𝐹𝐺) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (𝐺𝑥)})
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105   = wceq 1398  wex 1541  wcel 2202  wne 2403  {crab 2515  Vcvv 2803  cdif 3198  cin 3200  wss 3201   class class class wbr 4093  dom cdm 4731   Fn wfn 5328  cfv 5333
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341
This theorem is referenced by:  fndmdifcom  5762
  Copyright terms: Public domain W3C validator