Theorem satf00 32621

Description: The value of the satisfaction predicate as function over wff codes in the empty model with an empty binary relation at ∅. (Contributed by AV, 14-Sep-2023.)

Assertion

Ref	Expression
satf00	⊢ ((∅ Sat ∅)‘∅) = {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))}

Distinct variable group:   𝑖,𝑗,𝑥,𝑦

Proof of Theorem satf00

Dummy variables 𝑓 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		peano1 7601	. . 3 ⊢ ∅ ∈ ω
2		elelsuc 6263	. . 3 ⊢ (∅ ∈ ω → ∅ ∈ suc ω)
3		satf0sucom 32620	. . 3 ⊢ (∅ ∈ suc ω → ((∅ Sat ∅)‘∅) = (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘∅))
4	1, 2, 3	mp2b 10	. 2 ⊢ ((∅ Sat ∅)‘∅) = (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘∅)
5		omex 9106	. . . 4 ⊢ ω ∈ V
6	5, 5	xpex 7476	. . . 4 ⊢ (ω × ω) ∈ V
7		xpexg 7473	. . . . 5 ⊢ ((ω ∈ V ∧ (ω × ω) ∈ V) → (ω × (ω × ω)) ∈ V)
8		simpl 485	. . . . 5 ⊢ ((ω ∈ V ∧ (ω × ω) ∈ V) → ω ∈ V)
9		goelel3xp 32595	. . . . . . . 8 ⊢ ((𝑖 ∈ ω ∧ 𝑗 ∈ ω) → (𝑖∈𝑔𝑗) ∈ (ω × (ω × ω)))
10		eleq1 2900	. . . . . . . 8 ⊢ (𝑥 = (𝑖∈𝑔𝑗) → (𝑥 ∈ (ω × (ω × ω)) ↔ (𝑖∈𝑔𝑗) ∈ (ω × (ω × ω))))
11	9, 10	syl5ibrcom 249	. . . . . . 7 ⊢ ((𝑖 ∈ ω ∧ 𝑗 ∈ ω) → (𝑥 = (𝑖∈𝑔𝑗) → 𝑥 ∈ (ω × (ω × ω))))
12	11	rexlimivv 3292	. . . . . 6 ⊢ (∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗) → 𝑥 ∈ (ω × (ω × ω)))
13	12	ad2antll 727	. . . . 5 ⊢ (((ω ∈ V ∧ (ω × ω) ∈ V) ∧ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))) → 𝑥 ∈ (ω × (ω × ω)))
14		eleq1 2900	. . . . . . 7 ⊢ (𝑦 = ∅ → (𝑦 ∈ ω ↔ ∅ ∈ ω))
15	1, 14	mpbiri 260	. . . . . 6 ⊢ (𝑦 = ∅ → 𝑦 ∈ ω)
16	15	ad2antrl 726	. . . . 5 ⊢ (((ω ∈ V ∧ (ω × ω) ∈ V) ∧ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))) → 𝑦 ∈ ω)
17	7, 8, 13, 16	opabex2 7755	. . . 4 ⊢ ((ω ∈ V ∧ (ω × ω) ∈ V) → {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))} ∈ V)
18	5, 6, 17	mp2an 690	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))} ∈ V
19	18	rdg0 8057	. 2 ⊢ (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘∅) = {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))}
20	4, 19	eqtri 2844	1 ⊢ ((∅ Sat ∅)‘∅) = {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))}

Syntax hints:   ∧ wa 398   ∨ wo 843   = wceq 1537   ∈ wcel 2114  ∃wrex 3139  Vcvv 3494   ∪ cun 3934  ∅c0 4291  {copab 5128   ↦ cmpt 5146   × cxp 5553  suc csuc 6193  ‘cfv 6355  (class class class)co 7156  ωcom 7580  1^st c1st 7687  reccrdg 8045  ∈_𝑔cgoe 32580  ⊼_𝑔cgna 32581  ∀_𝑔cgol 32582   Sat csat 32583

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-inf2 9104

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-map 8408  df-goel 32587  df-sat 32590

This theorem is referenced by:  satf0op  32624  satf0n0  32625  sat1el2xp  32626  fmla0  32629  fmlafvel  32632