Theorem satefv 35389

Description: The simplified satisfaction predicate as function over wff codes in the model 𝑀 at the code 𝑈. (Contributed by AV, 30-Oct-2023.)

Assertion

Ref	Expression
satefv	⊢ ((𝑀 ∈ 𝑉 ∧ 𝑈 ∈ 𝑊) → (𝑀 Sat∈ 𝑈) = (((𝑀 Sat ( E ∩ (𝑀 × 𝑀)))‘ω)‘𝑈))

Proof of Theorem satefv

Dummy variables 𝑚 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-sate 35319	. . 3 ⊢ Sat∈ = (𝑚 ∈ V, 𝑢 ∈ V ↦ (((𝑚 Sat ( E ∩ (𝑚 × 𝑚)))‘ω)‘𝑢))
2	1	a1i 11	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝑈 ∈ 𝑊) → Sat∈ = (𝑚 ∈ V, 𝑢 ∈ V ↦ (((𝑚 Sat ( E ∩ (𝑚 × 𝑚)))‘ω)‘𝑢)))
3		id 22	. . . . . . 7 ⊢ (𝑚 = 𝑀 → 𝑚 = 𝑀)
4	3	sqxpeqd 5655	. . . . . . . 8 ⊢ (𝑚 = 𝑀 → (𝑚 × 𝑚) = (𝑀 × 𝑀))
5	4	ineq2d 4173	. . . . . . 7 ⊢ (𝑚 = 𝑀 → ( E ∩ (𝑚 × 𝑚)) = ( E ∩ (𝑀 × 𝑀)))
6	3, 5	oveq12d 7371	. . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑚 Sat ( E ∩ (𝑚 × 𝑚))) = (𝑀 Sat ( E ∩ (𝑀 × 𝑀))))
7	6	fveq1d 6828	. . . . 5 ⊢ (𝑚 = 𝑀 → ((𝑚 Sat ( E ∩ (𝑚 × 𝑚)))‘ω) = ((𝑀 Sat ( E ∩ (𝑀 × 𝑀)))‘ω))
8	7	adantr 480	. . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑢 = 𝑈) → ((𝑚 Sat ( E ∩ (𝑚 × 𝑚)))‘ω) = ((𝑀 Sat ( E ∩ (𝑀 × 𝑀)))‘ω))
9		simpr 484	. . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑢 = 𝑈) → 𝑢 = 𝑈)
10	8, 9	fveq12d 6833	. . 3 ⊢ ((𝑚 = 𝑀 ∧ 𝑢 = 𝑈) → (((𝑚 Sat ( E ∩ (𝑚 × 𝑚)))‘ω)‘𝑢) = (((𝑀 Sat ( E ∩ (𝑀 × 𝑀)))‘ω)‘𝑈))
11	10	adantl 481	. 2 ⊢ (((𝑀 ∈ 𝑉 ∧ 𝑈 ∈ 𝑊) ∧ (𝑚 = 𝑀 ∧ 𝑢 = 𝑈)) → (((𝑚 Sat ( E ∩ (𝑚 × 𝑚)))‘ω)‘𝑢) = (((𝑀 Sat ( E ∩ (𝑀 × 𝑀)))‘ω)‘𝑈))
12		elex 3459	. . 3 ⊢ (𝑀 ∈ 𝑉 → 𝑀 ∈ V)
13	12	adantr 480	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝑈 ∈ 𝑊) → 𝑀 ∈ V)
14		elex 3459	. . 3 ⊢ (𝑈 ∈ 𝑊 → 𝑈 ∈ V)
15	14	adantl 481	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝑈 ∈ 𝑊) → 𝑈 ∈ V)
16		fvexd 6841	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝑈 ∈ 𝑊) → (((𝑀 Sat ( E ∩ (𝑀 × 𝑀)))‘ω)‘𝑈) ∈ V)
17	2, 11, 13, 15, 16	ovmpod 7505	1 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝑈 ∈ 𝑊) → (𝑀 Sat∈ 𝑈) = (((𝑀 Sat ( E ∩ (𝑀 × 𝑀)))‘ω)‘𝑈))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  Vcvv 3438   ∩ cin 3904   E cep 5522   × cxp 5621  ‘cfv 6486  (class class class)co 7353   ∈ cmpo 7355  ωcom 7806   Sat csat 35311   Sat_∈ csate 35313

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-iota 6442  df-fun 6488  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-sate 35319

This theorem is referenced by:  sate0  35390  satef  35391  satefvfmla0  35393  satefvfmla1  35400