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

Theorem suppofssd 8185
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 7425 . . 3 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥𝑋𝑦) ∈ V)
2 suppofssd.3 . . 3 (𝜑𝐹:𝐴𝐵)
3 suppofssd.4 . . 3 (𝜑𝐺:𝐴𝐵)
4 suppofssd.1 . . 3 (𝜑𝐴𝑉)
5 inidm 4193 . . 3 (𝐴𝐴) = 𝐴
61, 2, 3, 4, 4, 5off 7674 . 2 (𝜑 → (𝐹f 𝑋𝐺):𝐴⟶V)
7 eldif 3927 . . . 4 (𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘𝐴 ∧ ¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))))
8 ioran 985 . . . . . 6 (¬ (𝑘 ∈ (𝐹 supp 𝑍) ∨ 𝑘 ∈ (𝐺 supp 𝑍)) ↔ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))
9 elun 4119 . . . . . 6 (𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) ↔ (𝑘 ∈ (𝐹 supp 𝑍) ∨ 𝑘 ∈ (𝐺 supp 𝑍)))
108, 9xchnxbir 333 . . . . 5 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) ↔ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))
1110anbi2i 623 . . . 4 ((𝑘𝐴 ∧ ¬ 𝑘 ∈ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))))
127, 11bitri 275 . . 3 (𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) ↔ (𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))))
132ffnd 6692 . . . . . . . . . 10 (𝜑𝐹 Fn 𝐴)
14 suppofssd.2 . . . . . . . . . 10 (𝜑𝑍𝐵)
15 elsuppfn 8152 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝐴𝑉𝑍𝐵) → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
1613, 4, 14, 15syl3anc 1373 . . . . . . . . 9 (𝜑 → (𝑘 ∈ (𝐹 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
1716notbid 318 . . . . . . . 8 (𝜑 → (¬ 𝑘 ∈ (𝐹 supp 𝑍) ↔ ¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
1817biimpd 229 . . . . . . 7 (𝜑 → (¬ 𝑘 ∈ (𝐹 supp 𝑍) → ¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
193ffnd 6692 . . . . . . . . . 10 (𝜑𝐺 Fn 𝐴)
20 elsuppfn 8152 . . . . . . . . . 10 ((𝐺 Fn 𝐴𝐴𝑉𝑍𝐵) → (𝑘 ∈ (𝐺 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
2119, 4, 14, 20syl3anc 1373 . . . . . . . . 9 (𝜑 → (𝑘 ∈ (𝐺 supp 𝑍) ↔ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
2221notbid 318 . . . . . . . 8 (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑍) ↔ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
2322biimpd 229 . . . . . . 7 (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑍) → ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
2418, 23anim12d 609 . . . . . 6 (𝜑 → ((¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)) → (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍))))
2524anim2d 612 . . . . 5 (𝜑 → ((𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍))) → (𝑘𝐴 ∧ (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))))
2625imp 406 . . . 4 ((𝜑 ∧ (𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))) → (𝑘𝐴 ∧ (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍))))
27 pm3.2 469 . . . . . . . 8 (𝑘𝐴 → ((𝐹𝑘) ≠ 𝑍 → (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍)))
2827necon1bd 2944 . . . . . . 7 (𝑘𝐴 → (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) → (𝐹𝑘) = 𝑍))
29 pm3.2 469 . . . . . . . 8 (𝑘𝐴 → ((𝐺𝑘) ≠ 𝑍 → (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))
3029necon1bd 2944 . . . . . . 7 (𝑘𝐴 → (¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍) → (𝐺𝑘) = 𝑍))
3128, 30anim12d 609 . . . . . 6 (𝑘𝐴 → ((¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)) → ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍)))
3231imdistani 568 . . . . 5 ((𝑘𝐴 ∧ (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍))) → (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍)))
3313adantr 480 . . . . . . 7 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → 𝐹 Fn 𝐴)
3419adantr 480 . . . . . . 7 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → 𝐺 Fn 𝐴)
354adantr 480 . . . . . . 7 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → 𝐴𝑉)
36 simprl 770 . . . . . . 7 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → 𝑘𝐴)
37 fnfvof 7673 . . . . . . 7 (((𝐹 Fn 𝐴𝐺 Fn 𝐴) ∧ (𝐴𝑉𝑘𝐴)) → ((𝐹f 𝑋𝐺)‘𝑘) = ((𝐹𝑘)𝑋(𝐺𝑘)))
3833, 34, 35, 36, 37syl22anc 838 . . . . . 6 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → ((𝐹f 𝑋𝐺)‘𝑘) = ((𝐹𝑘)𝑋(𝐺𝑘)))
39 oveq12 7399 . . . . . . 7 (((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍) → ((𝐹𝑘)𝑋(𝐺𝑘)) = (𝑍𝑋𝑍))
4039ad2antll 729 . . . . . 6 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → ((𝐹𝑘)𝑋(𝐺𝑘)) = (𝑍𝑋𝑍))
41 suppofssd.5 . . . . . . 7 (𝜑 → (𝑍𝑋𝑍) = 𝑍)
4241adantr 480 . . . . . 6 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → (𝑍𝑋𝑍) = 𝑍)
4338, 40, 423eqtrd 2769 . . . . 5 ((𝜑 ∧ (𝑘𝐴 ∧ ((𝐹𝑘) = 𝑍 ∧ (𝐺𝑘) = 𝑍))) → ((𝐹f 𝑋𝐺)‘𝑘) = 𝑍)
4432, 43sylan2 593 . . . 4 ((𝜑 ∧ (𝑘𝐴 ∧ (¬ (𝑘𝐴 ∧ (𝐹𝑘) ≠ 𝑍) ∧ ¬ (𝑘𝐴 ∧ (𝐺𝑘) ≠ 𝑍)))) → ((𝐹f 𝑋𝐺)‘𝑘) = 𝑍)
4526, 44syldan 591 . . 3 ((𝜑 ∧ (𝑘𝐴 ∧ (¬ 𝑘 ∈ (𝐹 supp 𝑍) ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑍)))) → ((𝐹f 𝑋𝐺)‘𝑘) = 𝑍)
4612, 45sylan2b 594 . 2 ((𝜑𝑘 ∈ (𝐴 ∖ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))) → ((𝐹f 𝑋𝐺)‘𝑘) = 𝑍)
476, 46suppss 8176 1 (𝜑 → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 847   = wceq 1540  wcel 2109  wne 2926  Vcvv 3450  cdif 3914  cun 3915  wss 3917   Fn wfn 6509  wf 6510  cfv 6514  (class class class)co 7390  f cof 7654   supp csupp 8142
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-of 7656  df-supp 8143
This theorem is referenced by:  psrbagaddcl  21840  mhpmulcl  22043  mhpaddcl  22045  naddcnff  43358
  Copyright terms: Public domain W3C validator