Theorem sategoelfvb 35613

Description: Characterization of a valuation 𝑆 of a simplified satisfaction predicate for a Godel-set of membership. (Contributed by AV, 5-Nov-2023.)

Hypothesis

Ref	Expression
sategoelfvb.s	⊢ 𝐸 = (𝑀 Sat∈ (𝐴∈𝑔𝐵))

Assertion

Ref	Expression
sategoelfvb	⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ (𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘𝐴) ∈ (𝑆‘𝐵))))

Proof of Theorem sategoelfvb

Dummy variables 𝑎 𝑏 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sategoelfvb.s	. . . . 5 ⊢ 𝐸 = (𝑀 Sat∈ (𝐴∈𝑔𝐵))
2		ovexd 7393	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈𝑔𝐵) ∈ V)
3		simpl 482	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐴 ∈ ω)
4		opeq1 4829	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝐴 → ⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝑏⟩)
5	4	opeq2d 4836	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐴 → ⟨∅, ⟨𝑎, 𝑏⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩)
6	5	eqeq2d 2747	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐴 → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
7	6	rexbidv 3160	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → (∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
8	7	adantl 481	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑎 = 𝐴) → (∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
9		simpr 484	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐵 ∈ ω)
10		opeq2 4830	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝐵 → ⟨𝐴, 𝑏⟩ = ⟨𝐴, 𝐵⟩)
11	10	opeq2d 4836	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝐵 → ⟨∅, ⟨𝐴, 𝑏⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
12	11	eqeq2d 2747	. . . . . . . . . . 11 ⊢ (𝑏 = 𝐵 → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩))
13	12	adantl 481	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑏 = 𝐵) → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩))
14		eqidd 2737	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
15	9, 13, 14	rspcedvd 3578	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩)
16	3, 8, 15	rspcedvd 3578	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑎 ∈ ω ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩)
17		goel 35541	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈𝑔𝐵) = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
18		goel 35541	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎∈𝑔𝑏) = ⟨∅, ⟨𝑎, 𝑏⟩⟩)
19	17, 18	eqeqan12d 2750	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑎 ∈ ω ∧ 𝑏 ∈ ω)) → ((𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏) ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩))
20	19	2rexbidva 3199	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏) ↔ ∃𝑎 ∈ ω ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩))
21	16, 20	mpbird 257	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏))
22		eqeq1 2740	. . . . . . . . 9 ⊢ (𝑥 = (𝐴∈𝑔𝐵) → (𝑥 = (𝑎∈𝑔𝑏) ↔ (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏)))
23	22	2rexbidv 3201	. . . . . . . 8 ⊢ (𝑥 = (𝐴∈𝑔𝐵) → (∃𝑎 ∈ ω ∃𝑏 ∈ ω 𝑥 = (𝑎∈𝑔𝑏) ↔ ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏)))
24		fmla0 35576	. . . . . . . 8 ⊢ (Fmla‘∅) = {𝑥 ∈ V ∣ ∃𝑎 ∈ ω ∃𝑏 ∈ ω 𝑥 = (𝑎∈𝑔𝑏)}
25	23, 24	elrab2 3649	. . . . . . 7 ⊢ ((𝐴∈𝑔𝐵) ∈ (Fmla‘∅) ↔ ((𝐴∈𝑔𝐵) ∈ V ∧ ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏)))
26	2, 21, 25	sylanbrc 583	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈𝑔𝐵) ∈ (Fmla‘∅))
27		satefvfmla0 35612	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴∈𝑔𝐵) ∈ (Fmla‘∅)) → (𝑀 Sat∈ (𝐴∈𝑔𝐵)) = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))})
28	26, 27	sylan2 593	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑀 Sat∈ (𝐴∈𝑔𝐵)) = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))})
29	1, 28	eqtrid 2783	. . . 4 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → 𝐸 = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))})
30	29	eleq2d 2822	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ 𝑆 ∈ {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))}))
31		fveq1 6833	. . . . 5 ⊢ (𝑎 = 𝑆 → (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))))
32		fveq1 6833	. . . . 5 ⊢ (𝑎 = 𝑆 → (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))))
33	31, 32	eleq12d 2830	. . . 4 ⊢ (𝑎 = 𝑆 → ((𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) ↔ (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))))
34	33	elrab 3646	. . 3 ⊢ (𝑆 ∈ {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))} ↔ (𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))))
35	30, 34	bitrdi 287	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ (𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))))))
36	17	fveq2d 6838	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(𝐴∈𝑔𝐵)) = (2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩))
37	36	fveq2d 6838	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘(2nd ‘(𝐴∈𝑔𝐵))) = (1st ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)))
38		0ex 5252	. . . . . . . . . 10 ⊢ ∅ ∈ V
39		opex 5412	. . . . . . . . . 10 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
40	38, 39	op2nd 7942	. . . . . . . . 9 ⊢ (2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩) = ⟨𝐴, 𝐵⟩
41	40	fveq2i 6837	. . . . . . . 8 ⊢ (1st ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = (1st ‘⟨𝐴, 𝐵⟩)
42		op1stg 7945	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
43	41, 42	eqtrid 2783	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = 𝐴)
44	37, 43	eqtrd 2771	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘(2nd ‘(𝐴∈𝑔𝐵))) = 𝐴)
45	44	fveq2d 6838	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘𝐴))
46	36	fveq2d 6838	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(2nd ‘(𝐴∈𝑔𝐵))) = (2nd ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)))
47	40	fveq2i 6837	. . . . . . . 8 ⊢ (2nd ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = (2nd ‘⟨𝐴, 𝐵⟩)
48		op2ndg 7946	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
49	47, 48	eqtrid 2783	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = 𝐵)
50	46, 49	eqtrd 2771	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(2nd ‘(𝐴∈𝑔𝐵))) = 𝐵)
51	50	fveq2d 6838	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘𝐵))
52	45, 51	eleq12d 2830	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) ↔ (𝑆‘𝐴) ∈ (𝑆‘𝐵)))
53	52	adantl 481	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) ↔ (𝑆‘𝐴) ∈ (𝑆‘𝐵)))
54	53	anbi2d 630	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))) ↔ (𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘𝐴) ∈ (𝑆‘𝐵))))
55	35, 54	bitrd 279	1 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ (𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘𝐴) ∈ (𝑆‘𝐵))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∃wrex 3060  {crab 3399  Vcvv 3440  ∅c0 4285  ⟨cop 4586  ‘cfv 6492  (class class class)co 7358  ωcom 7808  1^st c1st 7931  2^nd c2nd 7932   ↑_m cmap 8763  ∈_𝑔cgoe 35527  Fmlacfmla 35531   Sat_∈ csate 35532

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-inf2 9550  ax-ac2 10373

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  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 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-2o 8398  df-er 8635  df-map 8765  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-card 9851  df-ac 10026  df-goel 35534  df-gona 35535  df-goal 35536  df-sat 35537  df-sate 35538  df-fmla 35539

This theorem is referenced by:  sategoelfv  35614  ex-sategoelel  35615  ex-sategoelelomsuc  35620  ex-sategoelel12  35621