Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  satfvel Structured version   Visualization version   GIF version

Theorem satfvel 35610
Description: An element of the value of the satisfaction predicate as function over wff codes in the model 𝑀 and the binary relation 𝐸 on 𝑀 at the code 𝑈 for a wff using ∈ , ⊼ , ∀ is a valuation 𝑆:ω⟶𝑀 of the variables (v0 = (𝑆‘∅), v1 = (𝑆‘1o), etc.) so that 𝑈 is true under the assignment 𝑆. (Contributed by AV, 29-Oct-2023.)
Assertion
Ref Expression
satfvel (((𝑀𝑉𝐸𝑊) ∧ 𝑈 ∈ (Fmla‘ω) ∧ 𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈)) → 𝑆:ω⟶𝑀)

Proof of Theorem satfvel
StepHypRef Expression
1 satfun 35609 . . 3 ((𝑀𝑉𝐸𝑊) → ((𝑀 Sat 𝐸)‘ω):(Fmla‘ω)⟶𝒫 (𝑀m ω))
2 ffvelcdm 7027 . . . . 5 ((((𝑀 Sat 𝐸)‘ω):(Fmla‘ω)⟶𝒫 (𝑀m ω) ∧ 𝑈 ∈ (Fmla‘ω)) → (((𝑀 Sat 𝐸)‘ω)‘𝑈) ∈ 𝒫 (𝑀m ω))
3 fvex 6847 . . . . . . 7 (((𝑀 Sat 𝐸)‘ω)‘𝑈) ∈ V
43elpw 4546 . . . . . 6 ((((𝑀 Sat 𝐸)‘ω)‘𝑈) ∈ 𝒫 (𝑀m ω) ↔ (((𝑀 Sat 𝐸)‘ω)‘𝑈) ⊆ (𝑀m ω))
5 ssel 3916 . . . . . . 7 ((((𝑀 Sat 𝐸)‘ω)‘𝑈) ⊆ (𝑀m ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆 ∈ (𝑀m ω)))
6 elmapi 8789 . . . . . . 7 (𝑆 ∈ (𝑀m ω) → 𝑆:ω⟶𝑀)
75, 6syl6 35 . . . . . 6 ((((𝑀 Sat 𝐸)‘ω)‘𝑈) ⊆ (𝑀m ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀))
84, 7sylbi 217 . . . . 5 ((((𝑀 Sat 𝐸)‘ω)‘𝑈) ∈ 𝒫 (𝑀m ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀))
92, 8syl 17 . . . 4 ((((𝑀 Sat 𝐸)‘ω):(Fmla‘ω)⟶𝒫 (𝑀m ω) ∧ 𝑈 ∈ (Fmla‘ω)) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀))
109ex 412 . . 3 (((𝑀 Sat 𝐸)‘ω):(Fmla‘ω)⟶𝒫 (𝑀m ω) → (𝑈 ∈ (Fmla‘ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀)))
111, 10syl 17 . 2 ((𝑀𝑉𝐸𝑊) → (𝑈 ∈ (Fmla‘ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀)))
12113imp 1111 1 (((𝑀𝑉𝐸𝑊) ∧ 𝑈 ∈ (Fmla‘ω) ∧ 𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈)) → 𝑆:ω⟶𝑀)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087  wcel 2114  wss 3890  𝒫 cpw 4542  wf 6488  cfv 6492  (class class class)co 7360  ωcom 7810  m cmap 8766   Sat csat 35534  Fmlacfmla 35535
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-inf2 9553  ax-ac2 10376
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-2o 8399  df-er 8636  df-map 8768  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-card 9854  df-ac 10029  df-goel 35538  df-gona 35539  df-goal 35540  df-sat 35541  df-fmla 35543
This theorem is referenced by:  satef  35614  prv0  35628
  Copyright terms: Public domain W3C validator