Theorem satfvel 36344

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 (v₀ = (𝑆‘∅), v₁ = (𝑆‘1_o), etc.) so that 𝑈 is true under the assignment 𝑆. (Contributed by AV, 29-Oct-2023.)

Assertion

Ref	Expression
satfvel	⊢ (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑈 ∈ (Fmla‘ω) ∧ 𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈)) → 𝑆:ω⟶𝑀)

Proof of Theorem satfvel

Step	Hyp	Ref	Expression
1		satfun 36343	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → ((𝑀 Sat 𝐸)‘ω):(Fmla‘ω)⟶𝒫 (𝑀 ↑m ω))
2		ffvelcdm 7105	. . . . 5 ⊢ ((((𝑀 Sat 𝐸)‘ω):(Fmla‘ω)⟶𝒫 (𝑀 ↑m ω) ∧ 𝑈 ∈ (Fmla‘ω)) → (((𝑀 Sat 𝐸)‘ω)‘𝑈) ∈ 𝒫 (𝑀 ↑m ω))
3		fvex 6921	. . . . . . 7 ⊢ (((𝑀 Sat 𝐸)‘ω)‘𝑈) ∈ V
4	3	elpw 4564	. . . . . 6 ⊢ ((((𝑀 Sat 𝐸)‘ω)‘𝑈) ∈ 𝒫 (𝑀 ↑m ω) ↔ (((𝑀 Sat 𝐸)‘ω)‘𝑈) ⊆ (𝑀 ↑m ω))
5		ssel 3907	. . . . . . 7 ⊢ ((((𝑀 Sat 𝐸)‘ω)‘𝑈) ⊆ (𝑀 ↑m ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆 ∈ (𝑀 ↑m ω)))
6		elmapi 8897	. . . . . . 7 ⊢ (𝑆 ∈ (𝑀 ↑m ω) → 𝑆:ω⟶𝑀)
7	5, 6	syl6 36	. . . . . 6 ⊢ ((((𝑀 Sat 𝐸)‘ω)‘𝑈) ⊆ (𝑀 ↑m ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀))
8	4, 7	sylbi 220	. . . . 5 ⊢ ((((𝑀 Sat 𝐸)‘ω)‘𝑈) ∈ 𝒫 (𝑀 ↑m ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀))
9	2, 8	syl 18	. . . 4 ⊢ ((((𝑀 Sat 𝐸)‘ω):(Fmla‘ω)⟶𝒫 (𝑀 ↑m ω) ∧ 𝑈 ∈ (Fmla‘ω)) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀))
10	9	ex 418	. . 3 ⊢ (((𝑀 Sat 𝐸)‘ω):(Fmla‘ω)⟶𝒫 (𝑀 ↑m ω) → (𝑈 ∈ (Fmla‘ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀)))
11	1, 10	syl 18	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → (𝑈 ∈ (Fmla‘ω) → (𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈) → 𝑆:ω⟶𝑀)))
12	11	3imp 1128	1 ⊢ (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑈 ∈ (Fmla‘ω) ∧ 𝑆 ∈ (((𝑀 Sat 𝐸)‘ω)‘𝑈)) → 𝑆:ω⟶𝑀)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2147   ⊆ wss 3900  𝒫 cpw 4560  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443  ωcom 7901   ↑_m cmap 8875   Sat csat 36268  Fmlacfmla 36269

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-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-inf2 9669  ax-ac2 10568

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  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-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-isom 6567  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-2o 8505  df-er 8745  df-map 8877  df-en 9002  df-dom 9003  df-sdom 9004  df-fin 9005  df-card 10047  df-ac 10222  df-goel 36272  df-gona 36273  df-goal 36274  df-sat 36275  df-fmla 36277

This theorem is used by:  satef  36348  prv0  36362