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

Theorem extmptsuppeq 8167
Description: The support of an extended function is the same as the original. (Contributed by Mario Carneiro, 25-May-2015.) (Revised by AV, 30-Jun-2019.)
Hypotheses
Ref Expression
extmptsuppeq.b (𝜑𝐵𝑊)
extmptsuppeq.a (𝜑𝐴𝐵)
extmptsuppeq.z ((𝜑𝑛 ∈ (𝐵𝐴)) → 𝑋 = 𝑍)
Assertion
Ref Expression
extmptsuppeq (𝜑 → ((𝑛𝐴𝑋) supp 𝑍) = ((𝑛𝐵𝑋) supp 𝑍))
Distinct variable groups:   𝐴,𝑛   𝐵,𝑛   𝑛,𝑍   𝜑,𝑛
Allowed substitution hints:   𝑊(𝑛)   𝑋(𝑛)

Proof of Theorem extmptsuppeq
StepHypRef Expression
1 extmptsuppeq.a . . . . . . . . 9 (𝜑𝐴𝐵)
21adantl 481 . . . . . . . 8 ((𝑍 ∈ V ∧ 𝜑) → 𝐴𝐵)
32sseld 3945 . . . . . . 7 ((𝑍 ∈ V ∧ 𝜑) → (𝑛𝐴𝑛𝐵))
43anim1d 611 . . . . . 6 ((𝑍 ∈ V ∧ 𝜑) → ((𝑛𝐴𝑋 ∈ (V ∖ {𝑍})) → (𝑛𝐵𝑋 ∈ (V ∖ {𝑍}))))
5 eldif 3924 . . . . . . . . . . . . 13 (𝑛 ∈ (𝐵𝐴) ↔ (𝑛𝐵 ∧ ¬ 𝑛𝐴))
6 extmptsuppeq.z . . . . . . . . . . . . . 14 ((𝜑𝑛 ∈ (𝐵𝐴)) → 𝑋 = 𝑍)
76adantll 714 . . . . . . . . . . . . 13 (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛 ∈ (𝐵𝐴)) → 𝑋 = 𝑍)
85, 7sylan2br 595 . . . . . . . . . . . 12 (((𝑍 ∈ V ∧ 𝜑) ∧ (𝑛𝐵 ∧ ¬ 𝑛𝐴)) → 𝑋 = 𝑍)
98expr 456 . . . . . . . . . . 11 (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛𝐵) → (¬ 𝑛𝐴𝑋 = 𝑍))
10 elsn2g 4628 . . . . . . . . . . . . 13 (𝑍 ∈ V → (𝑋 ∈ {𝑍} ↔ 𝑋 = 𝑍))
11 elndif 4096 . . . . . . . . . . . . 13 (𝑋 ∈ {𝑍} → ¬ 𝑋 ∈ (V ∖ {𝑍}))
1210, 11biimtrrdi 254 . . . . . . . . . . . 12 (𝑍 ∈ V → (𝑋 = 𝑍 → ¬ 𝑋 ∈ (V ∖ {𝑍})))
1312ad2antrr 726 . . . . . . . . . . 11 (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛𝐵) → (𝑋 = 𝑍 → ¬ 𝑋 ∈ (V ∖ {𝑍})))
149, 13syld 47 . . . . . . . . . 10 (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛𝐵) → (¬ 𝑛𝐴 → ¬ 𝑋 ∈ (V ∖ {𝑍})))
1514con4d 115 . . . . . . . . 9 (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑛𝐵) → (𝑋 ∈ (V ∖ {𝑍}) → 𝑛𝐴))
1615impr 454 . . . . . . . 8 (((𝑍 ∈ V ∧ 𝜑) ∧ (𝑛𝐵𝑋 ∈ (V ∖ {𝑍}))) → 𝑛𝐴)
17 simprr 772 . . . . . . . 8 (((𝑍 ∈ V ∧ 𝜑) ∧ (𝑛𝐵𝑋 ∈ (V ∖ {𝑍}))) → 𝑋 ∈ (V ∖ {𝑍}))
1816, 17jca 511 . . . . . . 7 (((𝑍 ∈ V ∧ 𝜑) ∧ (𝑛𝐵𝑋 ∈ (V ∖ {𝑍}))) → (𝑛𝐴𝑋 ∈ (V ∖ {𝑍})))
1918ex 412 . . . . . 6 ((𝑍 ∈ V ∧ 𝜑) → ((𝑛𝐵𝑋 ∈ (V ∖ {𝑍})) → (𝑛𝐴𝑋 ∈ (V ∖ {𝑍}))))
204, 19impbid 212 . . . . 5 ((𝑍 ∈ V ∧ 𝜑) → ((𝑛𝐴𝑋 ∈ (V ∖ {𝑍})) ↔ (𝑛𝐵𝑋 ∈ (V ∖ {𝑍}))))
2120rabbidva2 3407 . . . 4 ((𝑍 ∈ V ∧ 𝜑) → {𝑛𝐴𝑋 ∈ (V ∖ {𝑍})} = {𝑛𝐵𝑋 ∈ (V ∖ {𝑍})})
22 eqid 2729 . . . . 5 (𝑛𝐴𝑋) = (𝑛𝐴𝑋)
23 extmptsuppeq.b . . . . . . 7 (𝜑𝐵𝑊)
2423, 1ssexd 5279 . . . . . 6 (𝜑𝐴 ∈ V)
2524adantl 481 . . . . 5 ((𝑍 ∈ V ∧ 𝜑) → 𝐴 ∈ V)
26 simpl 482 . . . . 5 ((𝑍 ∈ V ∧ 𝜑) → 𝑍 ∈ V)
2722, 25, 26mptsuppdifd 8165 . . . 4 ((𝑍 ∈ V ∧ 𝜑) → ((𝑛𝐴𝑋) supp 𝑍) = {𝑛𝐴𝑋 ∈ (V ∖ {𝑍})})
28 eqid 2729 . . . . 5 (𝑛𝐵𝑋) = (𝑛𝐵𝑋)
2923adantl 481 . . . . 5 ((𝑍 ∈ V ∧ 𝜑) → 𝐵𝑊)
3028, 29, 26mptsuppdifd 8165 . . . 4 ((𝑍 ∈ V ∧ 𝜑) → ((𝑛𝐵𝑋) supp 𝑍) = {𝑛𝐵𝑋 ∈ (V ∖ {𝑍})})
3121, 27, 303eqtr4d 2774 . . 3 ((𝑍 ∈ V ∧ 𝜑) → ((𝑛𝐴𝑋) supp 𝑍) = ((𝑛𝐵𝑋) supp 𝑍))
3231ex 412 . 2 (𝑍 ∈ V → (𝜑 → ((𝑛𝐴𝑋) supp 𝑍) = ((𝑛𝐵𝑋) supp 𝑍)))
33 simpr 484 . . . . 5 (((𝑛𝐴𝑋) ∈ V ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
34 supp0prc 8142 . . . . 5 (¬ ((𝑛𝐴𝑋) ∈ V ∧ 𝑍 ∈ V) → ((𝑛𝐴𝑋) supp 𝑍) = ∅)
3533, 34nsyl5 159 . . . 4 𝑍 ∈ V → ((𝑛𝐴𝑋) supp 𝑍) = ∅)
36 simpr 484 . . . . 5 (((𝑛𝐵𝑋) ∈ V ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
37 supp0prc 8142 . . . . 5 (¬ ((𝑛𝐵𝑋) ∈ V ∧ 𝑍 ∈ V) → ((𝑛𝐵𝑋) supp 𝑍) = ∅)
3836, 37nsyl5 159 . . . 4 𝑍 ∈ V → ((𝑛𝐵𝑋) supp 𝑍) = ∅)
3935, 38eqtr4d 2767 . . 3 𝑍 ∈ V → ((𝑛𝐴𝑋) supp 𝑍) = ((𝑛𝐵𝑋) supp 𝑍))
4039a1d 25 . 2 𝑍 ∈ V → (𝜑 → ((𝑛𝐴𝑋) supp 𝑍) = ((𝑛𝐵𝑋) supp 𝑍)))
4132, 40pm2.61i 182 1 (𝜑 → ((𝑛𝐴𝑋) supp 𝑍) = ((𝑛𝐵𝑋) supp 𝑍))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1540  wcel 2109  {crab 3405  Vcvv 3447  cdif 3911  wss 3914  c0 4296  {csn 4589  cmpt 5188  (class class class)co 7387   supp csupp 8139
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 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711
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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-supp 8140
This theorem is referenced by:  cantnfrescl  9629  cantnfres  9630
  Copyright terms: Public domain W3C validator