sategoelfvb - Mathbox for Mario Carneiro

	Mathbox for Mario Carneiro		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > sategoelfvb		Structured version Visualization version GIF version

Theorem sategoelfvb 34398

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 7440	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈_𝑔𝐵) ∈ V)
3		simpl 483	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐴 ∈ ω)
4		opeq1 4872	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝐴 → ⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝑏⟩)
5	4	opeq2d 4879	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐴 → ⟨∅, ⟨𝑎, 𝑏⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩)
6	5	eqeq2d 2743	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐴 → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
7	6	rexbidv 3178	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → (∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
8	7	adantl 482	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑎 = 𝐴) → (∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩ ↔ ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩))
9		simpr 485	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐵 ∈ ω)
10		opeq2 4873	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝐵 → ⟨𝐴, 𝑏⟩ = ⟨𝐴, 𝐵⟩)
11	10	opeq2d 4879	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝐵 → ⟨∅, ⟨𝐴, 𝑏⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
12	11	eqeq2d 2743	. . . . . . . . . . 11 ⊢ (𝑏 = 𝐵 → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩))
13	12	adantl 482	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑏 = 𝐵) → (⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩ ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩))
14		eqidd 2733	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
15	9, 13, 14	rspcedvd 3614	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝐴, 𝑏⟩⟩)
16	3, 8, 15	rspcedvd 3614	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑎 ∈ ω ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩)
17		goel 34326	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈_𝑔𝐵) = ⟨∅, ⟨𝐴, 𝐵⟩⟩)
18		goel 34326	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎∈_𝑔𝑏) = ⟨∅, ⟨𝑎, 𝑏⟩⟩)
19	17, 18	eqeqan12d 2746	. . . . . . . . 9 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑎 ∈ ω ∧ 𝑏 ∈ ω)) → ((𝐴∈_𝑔𝐵) = (𝑎∈_𝑔𝑏) ↔ ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩))
20	19	2rexbidva 3217	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈_𝑔𝐵) = (𝑎∈_𝑔𝑏) ↔ ∃𝑎 ∈ ω ∃𝑏 ∈ ω ⟨∅, ⟨𝐴, 𝐵⟩⟩ = ⟨∅, ⟨𝑎, 𝑏⟩⟩))
21	16, 20	mpbird 256	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈_𝑔𝐵) = (𝑎∈_𝑔𝑏))
22		eqeq1 2736	. . . . . . . . 9 ⊢ (𝑥 = (𝐴∈_𝑔𝐵) → (𝑥 = (𝑎∈_𝑔𝑏) ↔ (𝐴∈_𝑔𝐵) = (𝑎∈_𝑔𝑏)))
23	22	2rexbidv 3219	. . . . . . . 8 ⊢ (𝑥 = (𝐴∈_𝑔𝐵) → (∃𝑎 ∈ ω ∃𝑏 ∈ ω 𝑥 = (𝑎∈_𝑔𝑏) ↔ ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈_𝑔𝐵) = (𝑎∈_𝑔𝑏)))
24		fmla0 34361	. . . . . . . 8 ⊢ (Fmla‘∅) = {𝑥 ∈ V ∣ ∃𝑎 ∈ ω ∃𝑏 ∈ ω 𝑥 = (𝑎∈_𝑔𝑏)}
25	23, 24	elrab2 3685	. . . . . . 7 ⊢ ((𝐴∈_𝑔𝐵) ∈ (Fmla‘∅) ↔ ((𝐴∈_𝑔𝐵) ∈ V ∧ ∃𝑎 ∈ ω ∃𝑏 ∈ ω (𝐴∈_𝑔𝐵) = (𝑎∈_𝑔𝑏)))
26	2, 21, 25	sylanbrc 583	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴∈_𝑔𝐵) ∈ (Fmla‘∅))
27		satefvfmla0 34397	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴∈_𝑔𝐵) ∈ (Fmla‘∅)) → (𝑀 Sat_∈ (𝐴∈_𝑔𝐵)) = {𝑎 ∈ (𝑀 ↑_m ω) ∣ (𝑎‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑎‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))))})
28	26, 27	sylan2 593	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑀 Sat_∈ (𝐴∈_𝑔𝐵)) = {𝑎 ∈ (𝑀 ↑_m ω) ∣ (𝑎‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑎‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))))})
29	1, 28	eqtrid 2784	. . . 4 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → 𝐸 = {𝑎 ∈ (𝑀 ↑_m ω) ∣ (𝑎‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑎‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))))})
30	29	eleq2d 2819	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ 𝑆 ∈ {𝑎 ∈ (𝑀 ↑_m ω) ∣ (𝑎‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑎‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))))}))
31		fveq1 6887	. . . . 5 ⊢ (𝑎 = 𝑆 → (𝑎‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) = (𝑆‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))))
32		fveq1 6887	. . . . 5 ⊢ (𝑎 = 𝑆 → (𝑎‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) = (𝑆‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵)))))
33	31, 32	eleq12d 2827	. . . 4 ⊢ (𝑎 = 𝑆 → ((𝑎‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑎‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ↔ (𝑆‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑆‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))))))
34	33	elrab 3682	. . 3 ⊢ (𝑆 ∈ {𝑎 ∈ (𝑀 ↑_m ω) ∣ (𝑎‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑎‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))))} ↔ (𝑆 ∈ (𝑀 ↑_m ω) ∧ (𝑆‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑆‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))))))
35	30, 34	bitrdi 286	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ (𝑆 ∈ (𝑀 ↑_m ω) ∧ (𝑆‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑆‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵)))))))
36	17	fveq2d 6892	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2^nd ‘(𝐴∈_𝑔𝐵)) = (2^nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩))
37	36	fveq2d 6892	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵))) = (1^st ‘(2^nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)))
38		0ex 5306	. . . . . . . . . 10 ⊢ ∅ ∈ V
39		opex 5463	. . . . . . . . . 10 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
40	38, 39	op2nd 7980	. . . . . . . . 9 ⊢ (2^nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩) = ⟨𝐴, 𝐵⟩
41	40	fveq2i 6891	. . . . . . . 8 ⊢ (1^st ‘(2^nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = (1^st ‘⟨𝐴, 𝐵⟩)
42		op1stg 7983	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1^st ‘⟨𝐴, 𝐵⟩) = 𝐴)
43	41, 42	eqtrid 2784	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1^st ‘(2^nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = 𝐴)
44	37, 43	eqtrd 2772	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵))) = 𝐴)
45	44	fveq2d 6892	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑆‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) = (𝑆‘𝐴))
46	36	fveq2d 6892	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))) = (2^nd ‘(2^nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)))
47	40	fveq2i 6891	. . . . . . . 8 ⊢ (2^nd ‘(2^nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = (2^nd ‘⟨𝐴, 𝐵⟩)
48		op2ndg 7984	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2^nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
49	47, 48	eqtrid 2784	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2^nd ‘(2^nd ‘⟨∅, ⟨𝐴, 𝐵⟩⟩)) = 𝐵)
50	46, 49	eqtrd 2772	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))) = 𝐵)
51	50	fveq2d 6892	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑆‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) = (𝑆‘𝐵))
52	45, 51	eleq12d 2827	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑆‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑆‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ↔ (𝑆‘𝐴) ∈ (𝑆‘𝐵)))
53	52	adantl 482	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝑆‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑆‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ↔ (𝑆‘𝐴) ∈ (𝑆‘𝐵)))
54	53	anbi2d 629	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝑆 ∈ (𝑀 ↑_m ω) ∧ (𝑆‘(1^st ‘(2^nd ‘(𝐴∈_𝑔𝐵)))) ∈ (𝑆‘(2^nd ‘(2^nd ‘(𝐴∈_𝑔𝐵))))) ↔ (𝑆 ∈ (𝑀 ↑_m ω) ∧ (𝑆‘𝐴) ∈ (𝑆‘𝐵))))
55	35, 54	bitrd 278	1 ⊢ ((𝑀 ∈ 𝑉 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝑆 ∈ 𝐸 ↔ (𝑆 ∈ (𝑀 ↑_m ω) ∧ (𝑆‘𝐴) ∈ (𝑆‘𝐵))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∃wrex 3070 {crab 3432 Vcvv 3474 ∅c0 4321 ⟨cop 4633 ‘cfv 6540 (class class class)co 7405 ωcom 7851 1^st c1st 7969 2^nd c2nd 7970 ↑_m cmap 8816 ∈_𝑔cgoe 34312 Fmlacfmla 34316 Sat_∈ csate 34317

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-inf2 9632 ax-ac2 10454

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-2o 8463 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-card 9930 df-ac 10107 df-goel 34319 df-gona 34320 df-goal 34321 df-sat 34322 df-sate 34323 df-fmla 34324

This theorem is referenced by: sategoelfv 34399 ex-sategoelel 34400 ex-sategoelelomsuc 34405 ex-sategoelel12 34406

W3C validator