Theorem sategoelfvb 35892

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 7447	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈𝑔𝐵) ∈ V)
3		simpl 487	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐴 ∈ ω)
4		opeq1 4839	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝐴 → ⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝑏⟩)
5	4	opeq2d 4846	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐴 → ⟨∅, ⟨𝑎, 𝑏⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩)
6	5	eqeq2d 2774	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐴 → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
7	6	rexbidv 3189	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → (∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
8	7	adantl 486	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑎 = 𝐴) → (∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
9		simpr 489	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐵 ∈ ω)
10		opeq2 4840	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝐵 → ⟨𝐴, 𝑏⟩ = ⟨𝐴, 𝐵⟩)
11	10	opeq2d 4846	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝐵 → ⟨∅, ⟨𝐴, 𝑏⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
12	11	eqeq2d 2774	. . . . . . . . . . 11 ⊢ (𝑏 = 𝐵 → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩))
13	12	adantl 486	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑏 = 𝐵) → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩))
14		eqidd 2764	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
15	9, 13, 14	rspcedvd 3584	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩)
16	3, 8, 15	rspcedvd 3584	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑎 ∈ ω ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩)
17		goel 35820	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈𝑔𝐵) = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
18		goel 35820	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎∈𝑔𝑏) = ⟨∅, ⟨𝑎, 𝑏⟩⟩)
19	17, 18	eqeqan12d 2777	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑎 ∈ ω ∧ 𝑏 ∈ ω)) → ((𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏) ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩))
20	19	2rexbidva 3228	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏) ↔ ∃𝑎 ∈ ω ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩))
21	16, 20	mpbird 260	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏))
22		eqeq1 2767	. . . . . . . . 9 ⊢ (𝑥 = (𝐴∈𝑔𝐵) → (𝑥 = (𝑎∈𝑔𝑏) ↔ (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏)))
23	22	2rexbidv 3230	. . . . . . . 8 ⊢ (𝑥 = (𝐴∈𝑔𝐵) → (∃𝑎 ∈ ω ∃𝑏 ∈ ω 𝑥 = (𝑎∈𝑔𝑏) ↔ ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏)))
24		fmla0 35855	. . . . . . . 8 ⊢ (Fmla‘∅) = {𝑥 ∈ V ∣ ∃𝑎 ∈ ω ∃𝑏 ∈ ω 𝑥 = (𝑎∈𝑔𝑏)}
25	23, 24	elrab2 3655	. . . . . . 7 ⊢ ((𝐴∈𝑔𝐵) ∈ (Fmla‘∅) ↔ ((𝐴∈𝑔𝐵) ∈ V ∧ ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈𝑔𝐵) = (𝑎∈𝑔𝑏)))
26	2, 21, 25	sylanbrc 594	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈𝑔𝐵) ∈ (Fmla‘∅))
27		satefvfmla0 35891	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴∈𝑔𝐵) ∈ (Fmla‘∅)) → (𝑀 Sat∈ (𝐴∈𝑔𝐵)) = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))})
28	26, 27	sylan2 604	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑀 Sat∈ (𝐴∈𝑔𝐵)) = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))})
29	1, 28	eqtrid 2810	. . . 4 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → 𝐸 = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))})
30	29	eleq2d 2849	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ 𝑆 ∈ {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))}))
31		fveq1 6882	. . . . 5 ⊢ (𝑎 = 𝑆 → (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))))
32		fveq1 6882	. . . . 5 ⊢ (𝑎 = 𝑆 → (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))))
33	31, 32	eleq12d 2857	. . . 4 ⊢ (𝑎 = 𝑆 → ((𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) ↔ (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))))
34	33	elrab 3651	. . 3 ⊢ (𝑆 ∈ {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑎‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))} ↔ (𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))))
35	30, 34	bitrdi 290	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ (𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))))))
36	17	fveq2d 6887	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(𝐴∈𝑔𝐵)) = (2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩))
37	36	fveq2d 6887	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘(2nd ‘(𝐴∈𝑔𝐵))) = (1st ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)))
38		0ex 5271	. . . . . . . . . 10 ⊢ ∅ ∈ V
39		opex 5447	. . . . . . . . . 10 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
40	38, 39	op2nd 7996	. . . . . . . . 9 ⊢ (2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩) = ⟨𝐴, 𝐵⟩
41	40	fveq2i 6886	. . . . . . . 8 ⊢ (1st ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = (1st ‘⟨𝐴, 𝐵⟩)
42		op1stg 7999	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
43	41, 42	eqtrid 2810	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = 𝐴)
44	37, 43	eqtrd 2798	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1st ‘(2nd ‘(𝐴∈𝑔𝐵))) = 𝐴)
45	44	fveq2d 6887	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘𝐴))
46	36	fveq2d 6887	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(2nd ‘(𝐴∈𝑔𝐵))) = (2nd ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)))
47	40	fveq2i 6886	. . . . . . . 8 ⊢ (2nd ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = (2nd ‘⟨𝐴, 𝐵⟩)
48		op2ndg 8000	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
49	47, 48	eqtrid 2810	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(2nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = 𝐵)
50	46, 49	eqtrd 2798	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2nd ‘(2nd ‘(𝐴∈𝑔𝐵))) = 𝐵)
51	50	fveq2d 6887	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) = (𝑆‘𝐵))
52	45, 51	eleq12d 2857	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) ↔ (𝑆‘𝐴) ∈ (𝑆‘𝐵)))
53	52	adantl 486	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵)))) ↔ (𝑆‘𝐴) ∈ (𝑆‘𝐵)))
54	53	anbi2d 641	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘(1st ‘(2nd ‘(𝐴∈𝑔𝐵)))) ∈ (𝑆‘(2nd ‘(2nd ‘(𝐴∈𝑔𝐵))))) ↔ (𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘𝐴) ∈ (𝑆‘𝐵))))
55	35, 54	bitrd 282	1 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ (𝑆 ∈ (𝑀 ↑m ω) ∧ (𝑆‘𝐴) ∈ (𝑆‘𝐵))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∃wrex 3089  {crab 3416  Vcvv 3455  ∅c0 4287  ⟨cop 4596  ‘cfv 6538  (class class class)co 7412  ωcom 7863  1^st c1st 7985  2^nd c2nd 7986   ↑_m cmap 8825  ∈_𝑔cgoe 35806  Fmlacfmla 35810   Sat_∈ csate 35811

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-inf2 9611  ax-ac2 10448

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-2o 8455  df-er 8695  df-map 8827  df-en 8945  df-dom 8946  df-sdom 8947  df-fin 8948  df-card 9926  df-ac 10101  df-goel 35813  df-gona 35814  df-goal 35815  df-sat 35816  df-sate 35817  df-fmla 35818

This theorem is referenced by:  sategoelfv  35893  ex-sategoelel  35894  ex-sategoelelomsuc  35899  ex-sategoelel12  35900