Theorem sategoelfvb 35424

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 7466	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈𝑔𝐵) ∈ V)
3		simpl 482	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐴 ∈ ω)
4		opeq1 4873	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝐴 → ⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝑏⟩)
5	4	opeq2d 4880	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐴 → ⟨∅, ⟨𝑎, 𝑏⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩)
6	5	eqeq2d 2748	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐴 → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
7	6	rexbidv 3179	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → (∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
8	7	adantl 481	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑎 = 𝐴) → (∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
9		simpr 484	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐵 ∈ ω)
10		opeq2 4874	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝐵 → ⟨𝐴, 𝑏⟩ = ⟨𝐴, 𝐵⟩)
11	10	opeq2d 4880	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝐵 → ⟨∅, ⟨𝐴, 𝑏⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
12	11	eqeq2d 2748	. . . . . . . . . . 11 ⊢ (𝑏 = 𝐵 → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩))
13	12	adantl 481	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑏 = 𝐵) → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩))
14		eqidd 2738	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
15	9, 13, 14	rspcedvd 3624	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩)
16	3, 8, 15	rspcedvd 3624	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑎 ∈ ω ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩)
17		goel 35352	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈𝑔𝐵) = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
18		goel 35352	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎∈𝑔𝑏) = ⟨∅, ⟨𝑎, 𝑏⟩⟩)
19	17, 18	eqeqan12d 2751	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑎 ∈ ω ∧ 𝑏 ∈ ω)) → ((𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏) ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩))
20	19	2rexbidva 3220	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏) ↔ ∃𝑎 ∈ ω ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩))
21	16, 20	mpbird 257	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏))
22		eqeq1 2741	. . . . . . . . 9 ⊢ (𝑥 = (𝐴∈𝑔𝐵) → (𝑥 = (𝑎∈𝑔𝑏) ↔ (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏)))
23	22	2rexbidv 3222	. . . . . . . 8 ⊢ (𝑥 = (𝐴∈𝑔𝐵) → (∃𝑎 ∈ ω ∃𝑏 ∈ ω 𝑥 = (𝑎∈𝑔𝑏) ↔ ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏)))
24		fmla0 35387	. . . . . . . 8 ⊢ (Fmla‘∅) = {𝑥 ∈ V ∣ ∃𝑎 ∈ ω ∃𝑏 ∈ ω 𝑥 = (𝑎∈𝑔𝑏)}
25	23, 24	elrab2 3695	. . . . . . 7 ⊢ ((𝐴∈𝑔𝐵) ∈ (Fmla‘∅) ↔ ((𝐴∈𝑔𝐵) ∈ V ∧ ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏)))
26	2, 21, 25	sylanbrc 583	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈𝑔𝐵) ∈ (Fmla‘∅))
27		satefvfmla0 35423	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴∈𝑔𝐵) ∈ (Fmla‘∅)) → (𝑀 Sat∈ (𝐴∈𝑔𝐵)) = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))})
28	26, 27	sylan2 593	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑀 Sat∈ (𝐴∈𝑔𝐵)) = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))})
29	1, 28	eqtrid 2789	. . . 4 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → 𝐸 = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))})
30	29	eleq2d 2827	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ 𝑆 ∈ {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))}))
31		fveq1 6905	. . . . 5 ⊢ (𝑎 = 𝑆 → (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))))
32		fveq1 6905	. . . . 5 ⊢ (𝑎 = 𝑆 → (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))))
33	31, 32	eleq12d 2835	. . . 4 ⊢ (𝑎 = 𝑆 → ((𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) ↔ (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))))
34	33	elrab 3692	. . 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 6910	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(𝐴∈𝑔𝐵)) = (2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩))
37	36	fveq2d 6910	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘(2nd ‘(𝐴∈𝑔𝐵))) = (1st ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)))
38		0ex 5307	. . . . . . . . . 10 ⊢ ∅ ∈ V
39		opex 5469	. . . . . . . . . 10 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
40	38, 39	op2nd 8023	. . . . . . . . 9 ⊢ (2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩) = ⟨𝐴, 𝐵⟩
41	40	fveq2i 6909	. . . . . . . 8 ⊢ (1st ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = (1st ‘⟨𝐴, 𝐵⟩)
42		op1stg 8026	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
43	41, 42	eqtrid 2789	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = 𝐴)
44	37, 43	eqtrd 2777	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘(2nd ‘(𝐴∈𝑔𝐵))) = 𝐴)
45	44	fveq2d 6910	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘𝐴))
46	36	fveq2d 6910	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(2nd ‘(𝐴∈𝑔𝐵))) = (2nd ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)))
47	40	fveq2i 6909	. . . . . . . 8 ⊢ (2nd ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = (2nd ‘⟨𝐴, 𝐵⟩)
48		op2ndg 8027	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
49	47, 48	eqtrid 2789	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = 𝐵)
50	46, 49	eqtrd 2777	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(2nd ‘(𝐴∈𝑔𝐵))) = 𝐵)
51	50	fveq2d 6910	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘𝐵))
52	45, 51	eleq12d 2835	. . . 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 1540   ∈ wcel 2108  ∃wrex 3070  {crab 3436  Vcvv 3480  ∅c0 4333  ⟨cop 4632  ‘cfv 6561  (class class class)co 7431  ωcom 7887  1^st c1st 8012  2^nd c2nd 8013   ↑_m cmap 8866  ∈_𝑔cgoe 35338  Fmlacfmla 35342   Sat_∈ csate 35343

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-inf2 9681  ax-ac2 10503

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-se 5638  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-isom 6570  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-2o 8507  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-card 9979  df-ac 10156  df-goel 35345  df-gona 35346  df-goal 35347  df-sat 35348  df-sate 35349  df-fmla 35350

This theorem is referenced by:  sategoelfv  35425  ex-sategoelel  35426  ex-sategoelelomsuc  35431  ex-sategoelel12  35432