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

Theorem elfvmptrab1w 7044
Description: Implications for the value of a function defined by the maps-to notation with a class abstraction as a result having an element. Here, the base set of the class abstraction depends on the argument of the function. Version of elfvmptrab1 7045 with a disjoint variable condition, which does not require ax-13 2404. (Contributed by Alexander van der Vekens, 15-Jul-2018.) Avoid ax-13 2404. (Revised by GG, 26-Jan-2024.)
Hypotheses
Ref Expression
elfvmptrab1w.f 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ ⦋𝑥 / 𝑚⦌𝑀 ∣ 𝜑})
elfvmptrab1w.v (𝑋 ∈ 𝑉 → ⦋𝑋 / 𝑚⦌𝑀 ∈ V)
Assertion
Ref Expression
elfvmptrab1w (𝑌 ∈ (𝐹‘𝑋) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀))
Distinct variable groups:   𝑥,𝑀,𝑦   𝑥,𝑉   𝑥,𝑋,𝑦   𝑦,𝑌   𝑥,𝑚,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑚)   𝐹(𝑥, 𝑦, 𝑚)   𝑀(𝑚)   𝑉(𝑦, 𝑚)   𝑋(𝑚)   𝑌(𝑥, 𝑚)

Proof of Theorem elfvmptrab1w
StepHypRef Expression
1 elfvdm 6942 . 2 (𝑌 ∈ (𝐹‘𝑋) → 𝑋 ∈ dom 𝐹)
2 elfvmptrab1w.f . . . . . . 7 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∈ ⦋𝑥 / 𝑚⦌𝑀 ∣ 𝜑})
32dmmptss 6255 . . . . . 6 dom 𝐹 ⊆ 𝑉
43sseli 3909 . . . . 5 (𝑋 ∈ dom 𝐹 → 𝑋 ∈ 𝑉)
5 elfvmptrab1w.v . . . . . 6 (𝑋 ∈ 𝑉 → ⦋𝑋 / 𝑚⦌𝑀 ∈ V)
6 rabexg 5303 . . . . . 6 (⦋𝑋 / 𝑚⦌𝑀 ∈ V → {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} ∈ V)
74, 5, 63syl 19 . . . . 5 (𝑋 ∈ dom 𝐹 → {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} ∈ V)
8 nfcv 2926 . . . . . 6 Ⅎ𝑥𝑋
9 nfsbc1v 3762 . . . . . . 7 Ⅎ𝑥[𝑋 / 𝑥]𝜑
10 nfcv 2926 . . . . . . . 8 Ⅎ𝑥𝑀
118, 10nfcsbw 3877 . . . . . . 7 Ⅎ𝑥⦋𝑋 / 𝑚⦌𝑀
129, 11nfrabw 3451 . . . . . 6 Ⅎ𝑥{𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑}
13 csbeq1 3854 . . . . . . 7 (𝑥 = 𝑋 → ⦋𝑥 / 𝑚⦌𝑀 = ⦋𝑋 / 𝑚⦌𝑀)
14 sbceq1a 3753 . . . . . . 7 (𝑥 = 𝑋 → (𝜑 ↔ [𝑋 / 𝑥]𝜑))
1513, 14rabeqbidv 3433 . . . . . 6 (𝑥 = 𝑋 → {𝑦 ∈ ⦋𝑥 / 𝑚⦌𝑀 ∣ 𝜑} = {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑})
168, 12, 15, 2fvmptf 7038 . . . . 5 ((𝑋 ∈ 𝑉 ∧ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} ∈ V) → (𝐹‘𝑋) = {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑})
174, 7, 16syl2anc 596 . . . 4 (𝑋 ∈ dom 𝐹 → (𝐹‘𝑋) = {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑})
1817eleq2d 2850 . . 3 (𝑋 ∈ dom 𝐹 → (𝑌 ∈ (𝐹‘𝑋) ↔ 𝑌 ∈ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑}))
19 elrabi 3644 . . . . 5 (𝑌 ∈ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} → 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀)
204, 19anim12i 625 . . . 4 ((𝑋 ∈ dom 𝐹 ∧ 𝑌 ∈ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑}) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀))
2120ex 418 . . 3 (𝑋 ∈ dom 𝐹 → (𝑌 ∈ {𝑦 ∈ ⦋𝑋 / 𝑚⦌𝑀 ∣ [𝑋 / 𝑥]𝜑} → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀)))
2218, 21sylbid 243 . 2 (𝑋 ∈ dom 𝐹 → (𝑌 ∈ (𝐹‘𝑋) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀)))
231, 22mpcom 39 1 (𝑌 ∈ (𝐹‘𝑋) → (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ ⦋𝑋 / 𝑚⦌𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  [wsbc 3742  ⦋csb 3851   ↦ cmpt 5189  dom cdm 5655  ‘cfv 6558
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fv 6566
This theorem is used by:  elfvmptrab  7046
  Copyright terms: Public domain W3C validator