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

Theorem suppofssd 8144
Description: Condition for the support of a function operation to be a subset of the union of the supports of the left and right function terms. (Contributed by Steven Nguyen, 28-Aug-2023.)
Hypotheses
Ref Expression
suppofssd.1 (𝜑𝐴𝑉)
suppofssd.2 (𝜑𝑍𝐵)
suppofssd.3 (𝜑𝐹:𝐴𝐵)
suppofssd.4 (𝜑𝐺:𝐴𝐵)
suppofssd.5 (𝜑 → (𝑍𝑋𝑍) = 𝑍)
Assertion
Ref Expression
suppofssd (𝜑 → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))

Proof of Theorem suppofssd
Dummy variables 𝑥 𝑦 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ovexd 7392 . . 3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥𝑋𝑦) ∈ V)
2 suppofssd.3 . . 3 (𝜑𝐹:𝐴𝐵)
3 suppofssd.4 . . 3 (𝜑𝐺:𝐴𝐵)
4 suppofssd.1 . . 3 (𝜑𝐴𝑉)
5 inidm 4156 . . 3 (𝐴𝐴) = 𝐴
61, 2, 3, 4, 4, 5off 7639 . 2 (𝜑 → (𝐹f 𝑋𝐺):𝐴⟶V)
7 eldif 3893 . . . 4 (𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘𝐴 ∧ ¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))))
8 ioran 991 . . . . . 6 (¬ (𝑘 ∈ (𝐹 supp 𝑍) ∨ 𝑘 ∈ (𝐺 supp 𝑍)) ↔ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))
9 elun 4084 . . . . . 6 (𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) ↔ (𝑘 ∈ (𝐹 supp 𝑍) ∨ 𝑘 ∈ (𝐺 supp 𝑍)))
108, 9xchnxbir 334 . . . . 5 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) ↔ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))
1110anbi2i 629 . . . 4 ((𝑘𝐴 ∧ ¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))))
127, 11bitri 276 . . 3 (𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))))
132ffnd 6657 . . . . . . . . . 10 (𝜑𝐹 Fn 𝐴)
14 suppofssd.2 . . . . . . . . . 10 (𝜑𝑍𝐵)
15 elsuppfn 8111 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝐴𝑉𝑍𝐵) → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
1613, 4, 14, 15syl3anc 1379 . . . . . . . . 9 (𝜑 → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
1716notbid 319 . . . . . . . 8 (𝜑 → (¬ 𝑘 ∈ (𝐹 supp 𝑍) ↔ ¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
1817biimpd 230 . . . . . . 7 (𝜑 → (¬ 𝑘 ∈ (𝐹 supp 𝑍) → ¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
193ffnd 6657 . . . . . . . . . 10 (𝜑𝐺 Fn 𝐴)
20 elsuppfn 8111 . . . . . . . . . 10 ((𝐺 Fn 𝐴𝐴𝑉𝑍𝐵) → (𝑘 ∈ (𝐺 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
2119, 4, 14, 20syl3anc 1379 . . . . . . . . 9 (𝜑 → (𝑘 ∈ (𝐺 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
2221notbid 319 . . . . . . . 8 (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑍) ↔ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
2322biimpd 230 . . . . . . 7 (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑍) → ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
2418, 23anim12d 615 . . . . . 6 (𝜑 → ((¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)) → (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍))))
2524anim2d 618 . . . . 5 (𝜑 → ((𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))) → (𝑘𝐴 ∧ (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))))
2625imp 407 . . . 4 ((𝜑 ∧ (𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))) → (𝑘𝐴 ∧ (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍))))
27 pm3.2 470 . . . . . . . 8 (𝑘𝐴 → ((𝐹𝑘) ≠ 𝑍 → (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
2827necon1bd 2952 . . . . . . 7 (𝑘𝐴 → (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) → (𝐹𝑘) = 𝑍))
29 pm3.2 470 . . . . . . . 8 (𝑘𝐴 → ((𝐺𝑘) ≠ 𝑍 → (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
3029necon1bd 2952 . . . . . . 7 (𝑘𝐴 → (¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍) → (𝐺𝑘) = 𝑍))
3128, 30anim12d 615 . . . . . 6 (𝑘𝐴 → ((¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)) → ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍)))
3231imdistani 573 . . . . 5 ((𝑘𝐴 ∧ (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍))) → (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍)))
3313adantr 481 . . . . . . 7 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → 𝐹 Fn 𝐴)
3419adantr 481 . . . . . . 7 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → 𝐺 Fn 𝐴)
354adantr 481 . . . . . . 7 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → 𝐴𝑉)
36 simprl 776 . . . . . . 7 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → 𝑘𝐴)
37 fnfvof 7638 . . . . . . 7 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ (𝐴𝑉𝑘𝐴)) → ((𝐹f 𝑋𝐺)‘𝑘) = ((𝐹𝑘)𝑋(𝐺𝑘)))
3833, 34, 35, 36, 37syl22anc 844 . . . . . 6 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → ((𝐹f 𝑋𝐺)‘𝑘) = ((𝐹𝑘)𝑋(𝐺𝑘)))
39 oveq12 7366 . . . . . . 7 (((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍) → ((𝐹𝑘)𝑋(𝐺𝑘)) = (𝑍𝑋𝑍))
4039ad2antll 735 . . . . . 6 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → ((𝐹𝑘)𝑋(𝐺𝑘)) = (𝑍𝑋𝑍))
41 suppofssd.5 . . . . . . 7 (𝜑 → (𝑍𝑋𝑍) = 𝑍)
4241adantr 481 . . . . . 6 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → (𝑍𝑋𝑍) = 𝑍)
4338, 40, 423eqtrd 2778 . . . . 5 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → ((𝐹f 𝑋𝐺)‘𝑘) = 𝑍)
4432, 43sylan2 599 . . . 4 ((𝜑 ∧ (𝑘𝐴 ∧ (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))) → ((𝐹f 𝑋𝐺)‘𝑘) = 𝑍)
4526, 44syldan 597 . . 3 ((𝜑 ∧ (𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))) → ((𝐹f 𝑋𝐺)‘𝑘) = 𝑍)
4612, 45sylan2b 600 . 2 ((𝜑𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))) → ((𝐹f 𝑋𝐺)‘𝑘) = 𝑍)
476, 46suppss 8135 1 (𝜑 → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wo 853   = wceq 1547  wcel 2119  wne 2934  Vcvv 3431  cdif 3880  cun 3881  wss 3883   Fn wfn 6481  wf 6482  cfv 6486  (class class class)co 7357  f cof 7619   supp csupp 8101
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5200  ax-sep 5219  ax-nul 5229  ax-pr 5363  ax-un 7679
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4263  df-if 4456  df-pw 4532  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4840  df-iun 4924  df-br 5074  df-opab 5136  df-mpt 5155  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7360  df-oprab 7361  df-mpo 7362  df-of 7621  df-supp 8102
This theorem is referenced by:  psrbagaddcl  21900  mhpmulcl  22138  mhpaddcl  22140  naddcnff  43816
  Copyright terms: Public domain W3C validator