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

Theorem fvmptssdm 5718
Description: If all the values of the mapping are subsets of a class 𝐶, then so is any evaluation of the mapping at a value in the domain of the mapping. (Contributed by Jim Kingdon, 3-Jan-2018.)
Hypothesis
Ref Expression
fvmpt2.1 𝐹 = (𝑥𝐴𝐵)
Assertion
Ref Expression
fvmptssdm ((𝐷 ∈ dom 𝐹 ∧ ∀𝑥𝐴 𝐵𝐶) → (𝐹𝐷) ⊆ 𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐶
Allowed substitution hints:   𝐵(𝑥)   𝐷(𝑥)   𝐹(𝑥)

Proof of Theorem fvmptssdm
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 fveq2 5626 . . . . . 6 (𝑦 = 𝐷 → (𝐹𝑦) = (𝐹𝐷))
21sseq1d 3253 . . . . 5 (𝑦 = 𝐷 → ((𝐹𝑦) ⊆ 𝐶 ↔ (𝐹𝐷) ⊆ 𝐶))
32imbi2d 230 . . . 4 (𝑦 = 𝐷 → ((∀𝑥𝐴 𝐵𝐶 → (𝐹𝑦) ⊆ 𝐶) ↔ (∀𝑥𝐴 𝐵𝐶 → (𝐹𝐷) ⊆ 𝐶)))
4 nfrab1 2711 . . . . . . 7 𝑥{𝑥𝐴𝐵 ∈ V}
54nfcri 2366 . . . . . 6 𝑥 𝑦 ∈ {𝑥𝐴𝐵 ∈ V}
6 nfra1 2561 . . . . . . 7 𝑥𝑥𝐴 𝐵𝐶
7 fvmpt2.1 . . . . . . . . . 10 𝐹 = (𝑥𝐴𝐵)
8 nfmpt1 4176 . . . . . . . . . 10 𝑥(𝑥𝐴𝐵)
97, 8nfcxfr 2369 . . . . . . . . 9 𝑥𝐹
10 nfcv 2372 . . . . . . . . 9 𝑥𝑦
119, 10nffv 5636 . . . . . . . 8 𝑥(𝐹𝑦)
12 nfcv 2372 . . . . . . . 8 𝑥𝐶
1311, 12nfss 3217 . . . . . . 7 𝑥(𝐹𝑦) ⊆ 𝐶
146, 13nfim 1618 . . . . . 6 𝑥(∀𝑥𝐴 𝐵𝐶 → (𝐹𝑦) ⊆ 𝐶)
155, 14nfim 1618 . . . . 5 𝑥(𝑦 ∈ {𝑥𝐴𝐵 ∈ V} → (∀𝑥𝐴 𝐵𝐶 → (𝐹𝑦) ⊆ 𝐶))
16 eleq1 2292 . . . . . 6 (𝑥 = 𝑦 → (𝑥 ∈ {𝑥𝐴𝐵 ∈ V} ↔ 𝑦 ∈ {𝑥𝐴𝐵 ∈ V}))
17 fveq2 5626 . . . . . . . 8 (𝑥 = 𝑦 → (𝐹𝑥) = (𝐹𝑦))
1817sseq1d 3253 . . . . . . 7 (𝑥 = 𝑦 → ((𝐹𝑥) ⊆ 𝐶 ↔ (𝐹𝑦) ⊆ 𝐶))
1918imbi2d 230 . . . . . 6 (𝑥 = 𝑦 → ((∀𝑥𝐴 𝐵𝐶 → (𝐹𝑥) ⊆ 𝐶) ↔ (∀𝑥𝐴 𝐵𝐶 → (𝐹𝑦) ⊆ 𝐶)))
2016, 19imbi12d 234 . . . . 5 (𝑥 = 𝑦 → ((𝑥 ∈ {𝑥𝐴𝐵 ∈ V} → (∀𝑥𝐴 𝐵𝐶 → (𝐹𝑥) ⊆ 𝐶)) ↔ (𝑦 ∈ {𝑥𝐴𝐵 ∈ V} → (∀𝑥𝐴 𝐵𝐶 → (𝐹𝑦) ⊆ 𝐶))))
217dmmpt 5223 . . . . . . 7 dom 𝐹 = {𝑥𝐴𝐵 ∈ V}
2221eleq2i 2296 . . . . . 6 (𝑥 ∈ dom 𝐹𝑥 ∈ {𝑥𝐴𝐵 ∈ V})
2321rabeq2i 2796 . . . . . . . . . 10 (𝑥 ∈ dom 𝐹 ↔ (𝑥𝐴𝐵 ∈ V))
247fvmpt2 5717 . . . . . . . . . . 11 ((𝑥𝐴𝐵 ∈ V) → (𝐹𝑥) = 𝐵)
25 eqimss 3278 . . . . . . . . . . 11 ((𝐹𝑥) = 𝐵 → (𝐹𝑥) ⊆ 𝐵)
2624, 25syl 14 . . . . . . . . . 10 ((𝑥𝐴𝐵 ∈ V) → (𝐹𝑥) ⊆ 𝐵)
2723, 26sylbi 121 . . . . . . . . 9 (𝑥 ∈ dom 𝐹 → (𝐹𝑥) ⊆ 𝐵)
2827adantr 276 . . . . . . . 8 ((𝑥 ∈ dom 𝐹 ∧ ∀𝑥𝐴 𝐵𝐶) → (𝐹𝑥) ⊆ 𝐵)
297dmmptss 5224 . . . . . . . . . 10 dom 𝐹𝐴
3029sseli 3220 . . . . . . . . 9 (𝑥 ∈ dom 𝐹𝑥𝐴)
31 rsp 2577 . . . . . . . . 9 (∀𝑥𝐴 𝐵𝐶 → (𝑥𝐴𝐵𝐶))
3230, 31mpan9 281 . . . . . . . 8 ((𝑥 ∈ dom 𝐹 ∧ ∀𝑥𝐴 𝐵𝐶) → 𝐵𝐶)
3328, 32sstrd 3234 . . . . . . 7 ((𝑥 ∈ dom 𝐹 ∧ ∀𝑥𝐴 𝐵𝐶) → (𝐹𝑥) ⊆ 𝐶)
3433ex 115 . . . . . 6 (𝑥 ∈ dom 𝐹 → (∀𝑥𝐴 𝐵𝐶 → (𝐹𝑥) ⊆ 𝐶))
3522, 34sylbir 135 . . . . 5 (𝑥 ∈ {𝑥𝐴𝐵 ∈ V} → (∀𝑥𝐴 𝐵𝐶 → (𝐹𝑥) ⊆ 𝐶))
3615, 20, 35chvar 1803 . . . 4 (𝑦 ∈ {𝑥𝐴𝐵 ∈ V} → (∀𝑥𝐴 𝐵𝐶 → (𝐹𝑦) ⊆ 𝐶))
373, 36vtoclga 2867 . . 3 (𝐷 ∈ {𝑥𝐴𝐵 ∈ V} → (∀𝑥𝐴 𝐵𝐶 → (𝐹𝐷) ⊆ 𝐶))
3837, 21eleq2s 2324 . 2 (𝐷 ∈ dom 𝐹 → (∀𝑥𝐴 𝐵𝐶 → (𝐹𝐷) ⊆ 𝐶))
3938imp 124 1 ((𝐷 ∈ dom 𝐹 ∧ ∀𝑥𝐴 𝐵𝐶) → (𝐹𝐷) ⊆ 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  wral 2508  {crab 2512  Vcvv 2799  wss 3197  cmpt 4144  dom cdm 4718  cfv 5317
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-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fv 5325
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator