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

Theorem fnsuppres 7844
 Description: Two ways to express restriction of a support set. (Contributed by Stefan O'Rear, 5-Feb-2015.) (Revised by AV, 28-May-2019.)
Assertion
Ref Expression
fnsuppres ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → ((𝐹 supp 𝑍) ⊆ 𝐴 ↔ (𝐹𝐵) = (𝐵 × {𝑍})))

Proof of Theorem fnsuppres
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 fndm 6429 . . . . . 6 (𝐹 Fn (𝐴𝐵) → dom 𝐹 = (𝐴𝐵))
21rabeqdv 3435 . . . . 5 (𝐹 Fn (𝐴𝐵) → {𝑎 ∈ dom 𝐹 ∣ (𝐹𝑎) ≠ 𝑍} = {𝑎 ∈ (𝐴𝐵) ∣ (𝐹𝑎) ≠ 𝑍})
323ad2ant1 1130 . . . 4 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → {𝑎 ∈ dom 𝐹 ∣ (𝐹𝑎) ≠ 𝑍} = {𝑎 ∈ (𝐴𝐵) ∣ (𝐹𝑎) ≠ 𝑍})
43sseq1d 3949 . . 3 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → ({𝑎 ∈ dom 𝐹 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ↔ {𝑎 ∈ (𝐴𝐵) ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴))
5 unss 4114 . . . . 5 (({𝑎𝐴 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ∧ {𝑎𝐵 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴) ↔ ({𝑎𝐴 ∣ (𝐹𝑎) ≠ 𝑍} ∪ {𝑎𝐵 ∣ (𝐹𝑎) ≠ 𝑍}) ⊆ 𝐴)
6 ssrab2 4010 . . . . . 6 {𝑎𝐴 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴
76biantrur 534 . . . . 5 ({𝑎𝐵 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ↔ ({𝑎𝐴 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ∧ {𝑎𝐵 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴))
8 rabun2 4237 . . . . . 6 {𝑎 ∈ (𝐴𝐵) ∣ (𝐹𝑎) ≠ 𝑍} = ({𝑎𝐴 ∣ (𝐹𝑎) ≠ 𝑍} ∪ {𝑎𝐵 ∣ (𝐹𝑎) ≠ 𝑍})
98sseq1i 3946 . . . . 5 ({𝑎 ∈ (𝐴𝐵) ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ↔ ({𝑎𝐴 ∣ (𝐹𝑎) ≠ 𝑍} ∪ {𝑎𝐵 ∣ (𝐹𝑎) ≠ 𝑍}) ⊆ 𝐴)
105, 7, 93bitr4ri 307 . . . 4 ({𝑎 ∈ (𝐴𝐵) ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ↔ {𝑎𝐵 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴)
11 rabss 4002 . . . . 5 ({𝑎𝐵 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ↔ ∀𝑎𝐵 ((𝐹𝑎) ≠ 𝑍𝑎𝐴))
12 fvres 6668 . . . . . . . . 9 (𝑎𝐵 → ((𝐹𝐵)‘𝑎) = (𝐹𝑎))
1312adantl 485 . . . . . . . 8 (((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) ∧ 𝑎𝐵) → ((𝐹𝐵)‘𝑎) = (𝐹𝑎))
14 simp2r 1197 . . . . . . . . 9 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → 𝑍𝑉)
15 fvconst2g 6945 . . . . . . . . 9 ((𝑍𝑉𝑎𝐵) → ((𝐵 × {𝑍})‘𝑎) = 𝑍)
1614, 15sylan 583 . . . . . . . 8 (((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) ∧ 𝑎𝐵) → ((𝐵 × {𝑍})‘𝑎) = 𝑍)
1713, 16eqeq12d 2817 . . . . . . 7 (((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) ∧ 𝑎𝐵) → (((𝐹𝐵)‘𝑎) = ((𝐵 × {𝑍})‘𝑎) ↔ (𝐹𝑎) = 𝑍))
18 nne 2994 . . . . . . . 8 (¬ (𝐹𝑎) ≠ 𝑍 ↔ (𝐹𝑎) = 𝑍)
1918a1i 11 . . . . . . 7 (((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) ∧ 𝑎𝐵) → (¬ (𝐹𝑎) ≠ 𝑍 ↔ (𝐹𝑎) = 𝑍))
20 id 22 . . . . . . . . 9 (𝑎𝐵𝑎𝐵)
21 simp3 1135 . . . . . . . . 9 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → (𝐴𝐵) = ∅)
22 minel 4376 . . . . . . . . 9 ((𝑎𝐵 ∧ (𝐴𝐵) = ∅) → ¬ 𝑎𝐴)
2320, 21, 22syl2anr 599 . . . . . . . 8 (((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) ∧ 𝑎𝐵) → ¬ 𝑎𝐴)
24 mtt 368 . . . . . . . 8 𝑎𝐴 → (¬ (𝐹𝑎) ≠ 𝑍 ↔ ((𝐹𝑎) ≠ 𝑍𝑎𝐴)))
2523, 24syl 17 . . . . . . 7 (((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) ∧ 𝑎𝐵) → (¬ (𝐹𝑎) ≠ 𝑍 ↔ ((𝐹𝑎) ≠ 𝑍𝑎𝐴)))
2617, 19, 253bitr2rd 311 . . . . . 6 (((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) ∧ 𝑎𝐵) → (((𝐹𝑎) ≠ 𝑍𝑎𝐴) ↔ ((𝐹𝐵)‘𝑎) = ((𝐵 × {𝑍})‘𝑎)))
2726ralbidva 3164 . . . . 5 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → (∀𝑎𝐵 ((𝐹𝑎) ≠ 𝑍𝑎𝐴) ↔ ∀𝑎𝐵 ((𝐹𝐵)‘𝑎) = ((𝐵 × {𝑍})‘𝑎)))
2811, 27syl5bb 286 . . . 4 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → ({𝑎𝐵 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ↔ ∀𝑎𝐵 ((𝐹𝐵)‘𝑎) = ((𝐵 × {𝑍})‘𝑎)))
2910, 28syl5bb 286 . . 3 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → ({𝑎 ∈ (𝐴𝐵) ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ↔ ∀𝑎𝐵 ((𝐹𝐵)‘𝑎) = ((𝐵 × {𝑍})‘𝑎)))
304, 29bitrd 282 . 2 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → ({𝑎 ∈ dom 𝐹 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴 ↔ ∀𝑎𝐵 ((𝐹𝐵)‘𝑎) = ((𝐵 × {𝑍})‘𝑎)))
31 fnfun 6427 . . . . . . 7 (𝐹 Fn (𝐴𝐵) → Fun 𝐹)
32313anim1i 1149 . . . . . 6 ((𝐹 Fn (𝐴𝐵) ∧ 𝐹𝑊𝑍𝑉) → (Fun 𝐹𝐹𝑊𝑍𝑉))
33323expb 1117 . . . . 5 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉)) → (Fun 𝐹𝐹𝑊𝑍𝑉))
34 suppval1 7823 . . . . 5 ((Fun 𝐹𝐹𝑊𝑍𝑉) → (𝐹 supp 𝑍) = {𝑎 ∈ dom 𝐹 ∣ (𝐹𝑎) ≠ 𝑍})
3533, 34syl 17 . . . 4 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉)) → (𝐹 supp 𝑍) = {𝑎 ∈ dom 𝐹 ∣ (𝐹𝑎) ≠ 𝑍})
36353adant3 1129 . . 3 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → (𝐹 supp 𝑍) = {𝑎 ∈ dom 𝐹 ∣ (𝐹𝑎) ≠ 𝑍})
3736sseq1d 3949 . 2 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → ((𝐹 supp 𝑍) ⊆ 𝐴 ↔ {𝑎 ∈ dom 𝐹 ∣ (𝐹𝑎) ≠ 𝑍} ⊆ 𝐴))
38 simp1 1133 . . . 4 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → 𝐹 Fn (𝐴𝐵))
39 ssun2 4103 . . . . 5 𝐵 ⊆ (𝐴𝐵)
4039a1i 11 . . . 4 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → 𝐵 ⊆ (𝐴𝐵))
41 fnssres 6446 . . . 4 ((𝐹 Fn (𝐴𝐵) ∧ 𝐵 ⊆ (𝐴𝐵)) → (𝐹𝐵) Fn 𝐵)
4238, 40, 41syl2anc 587 . . 3 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → (𝐹𝐵) Fn 𝐵)
43 fnconstg 6545 . . . . 5 (𝑍𝑉 → (𝐵 × {𝑍}) Fn 𝐵)
4443adantl 485 . . . 4 ((𝐹𝑊𝑍𝑉) → (𝐵 × {𝑍}) Fn 𝐵)
45443ad2ant2 1131 . . 3 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → (𝐵 × {𝑍}) Fn 𝐵)
46 eqfnfv 6783 . . 3 (((𝐹𝐵) Fn 𝐵 ∧ (𝐵 × {𝑍}) Fn 𝐵) → ((𝐹𝐵) = (𝐵 × {𝑍}) ↔ ∀𝑎𝐵 ((𝐹𝐵)‘𝑎) = ((𝐵 × {𝑍})‘𝑎)))
4742, 45, 46syl2anc 587 . 2 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → ((𝐹𝐵) = (𝐵 × {𝑍}) ↔ ∀𝑎𝐵 ((𝐹𝐵)‘𝑎) = ((𝐵 × {𝑍})‘𝑎)))
4830, 37, 473bitr4d 314 1 ((𝐹 Fn (𝐴𝐵) ∧ (𝐹𝑊𝑍𝑉) ∧ (𝐴𝐵) = ∅) → ((𝐹 supp 𝑍) ⊆ 𝐴 ↔ (𝐹𝐵) = (𝐵 × {𝑍})))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2112   ≠ wne 2990  ∀wral 3109  {crab 3113   ∪ cun 3882   ∩ cin 3883   ⊆ wss 3884  ∅c0 4246  {csn 4528   × cxp 5521  dom cdm 5523   ↾ cres 5525  Fun wfun 6322   Fn wfn 6323  ‘cfv 6328  (class class class)co 7139   supp csupp 7817 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7445 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-ral 3114  df-rex 3115  df-rab 3118  df-v 3446  df-sbc 3724  df-csb 3832  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5428  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-fv 6336  df-ov 7142  df-oprab 7143  df-mpo 7144  df-supp 7818 This theorem is referenced by:  fnsuppeq0  7845  frlmsslss2  20468  resf1o  30496
 Copyright terms: Public domain W3C validator