Theorem fmla 35744

Description: The set of all valid Godel formulas. (Contributed by AV, 20-Sep-2023.)

Assertion

Ref	Expression
fmla	⊢ (Fmla‘ω) = ∪ 𝑛 ∈ ω (Fmla‘𝑛)

Proof of Theorem fmla

Dummy variables 𝑓 𝑖 𝑗 𝑢 𝑣 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-fmla 35708	. . 3 ⊢ Fmla = (𝑛 ∈ suc ω ↦ dom ((∅ Sat ∅)‘𝑛))
2	1	fveq1i 6872	. 2 ⊢ (Fmla‘ω) = ((𝑛 ∈ suc ω ↦ dom ((∅ Sat ∅)‘𝑛))‘ω)
3		omex 9600	. . 3 ⊢ ω ∈ V
4		eqidd 2766	. . . 4 ⊢ (ω ∈ V → (𝑛 ∈ suc ω ↦ dom ((∅ Sat ∅)‘𝑛)) = (𝑛 ∈ suc ω ↦ dom ((∅ Sat ∅)‘𝑛)))
5		fveq2 6871	. . . . . 6 ⊢ (𝑛 = ω → ((∅ Sat ∅)‘𝑛) = ((∅ Sat ∅)‘ω))
6	5	dmeqd 5886	. . . . 5 ⊢ (𝑛 = ω → dom ((∅ Sat ∅)‘𝑛) = dom ((∅ Sat ∅)‘ω))
7	6	adantl 486	. . . 4 ⊢ ((ω ∈ V ∧ 𝑛 = ω) → dom ((∅ Sat ∅)‘𝑛) = dom ((∅ Sat ∅)‘ω))
8		sucidg 6433	. . . 4 ⊢ (ω ∈ V → ω ∈ suc ω)
9		fvex 6884	. . . . . 6 ⊢ ((∅ Sat ∅)‘ω) ∈ V
10	9	dmex 7894	. . . . 5 ⊢ dom ((∅ Sat ∅)‘ω) ∈ V
11	10	a1i 11	. . . 4 ⊢ (ω ∈ V → dom ((∅ Sat ∅)‘ω) ∈ V)
12	4, 7, 8, 11	fvmptd 6987	. . 3 ⊢ (ω ∈ V → ((𝑛 ∈ suc ω ↦ dom ((∅ Sat ∅)‘𝑛))‘ω) = dom ((∅ Sat ∅)‘ω))
13	3, 12	ax-mp 5	. 2 ⊢ ((𝑛 ∈ suc ω ↦ dom ((∅ Sat ∅)‘𝑛))‘ω) = dom ((∅ Sat ∅)‘ω)
14	3	sucid 6434	. . . . . 6 ⊢ ω ∈ suc ω
15		satf0sucom 35736	. . . . . 6 ⊢ (ω ∈ suc ω → ((∅ Sat ∅)‘ω) = (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘ω))
16	14, 15	ax-mp 5	. . . . 5 ⊢ ((∅ Sat ∅)‘ω) = (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘ω)
17		limom 7866	. . . . . 6 ⊢ Lim ω
18		rdglim2a 8408	. . . . . 6 ⊢ ((ω ∈ V ∧ Lim ω) → (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘ω) = ∪ 𝑛 ∈ ω (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛))
19	3, 17, 18	mp2an 704	. . . . 5 ⊢ (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘ω) = ∪ 𝑛 ∈ ω (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛)
20	16, 19	eqtri 2788	. . . 4 ⊢ ((∅ Sat ∅)‘ω) = ∪ 𝑛 ∈ ω (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛)
21	20	dmeqi 5885	. . 3 ⊢ dom ((∅ Sat ∅)‘ω) = dom ∪ 𝑛 ∈ ω (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛)
22		dmiun 5894	. . 3 ⊢ dom ∪ 𝑛 ∈ ω (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛) = ∪ 𝑛 ∈ ω dom (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛)
23		elelsuc 6425	. . . . . 6 ⊢ (𝑛 ∈ ω → 𝑛 ∈ suc ω)
24		fmlafv 35743	. . . . . 6 ⊢ (𝑛 ∈ suc ω → (Fmla‘𝑛) = dom ((∅ Sat ∅)‘𝑛))
25	23, 24	syl 18	. . . . 5 ⊢ (𝑛 ∈ ω → (Fmla‘𝑛) = dom ((∅ Sat ∅)‘𝑛))
26		satf0sucom 35736	. . . . . . 7 ⊢ (𝑛 ∈ suc ω → ((∅ Sat ∅)‘𝑛) = (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛))
27	23, 26	syl 18	. . . . . 6 ⊢ (𝑛 ∈ ω → ((∅ Sat ∅)‘𝑛) = (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛))
28	27	dmeqd 5886	. . . . 5 ⊢ (𝑛 ∈ ω → dom ((∅ Sat ∅)‘𝑛) = dom (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛))
29	25, 28	eqtr2d 2801	. . . 4 ⊢ (𝑛 ∈ ω → dom (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛) = (Fmla‘𝑛))
30	29	iuneq2i 4974	. . 3 ⊢ ∪ 𝑛 ∈ ω dom (rec((𝑓 ∈ V ↦ (𝑓 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {⟨𝑥, 𝑦⟩ ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘𝑛) = ∪ 𝑛 ∈ ω (Fmla‘𝑛)
31	21, 22, 30	3eqtri 2792	. 2 ⊢ dom ((∅ Sat ∅)‘ω) = ∪ 𝑛 ∈ ω (Fmla‘𝑛)
32	2, 13, 31	3eqtri 2792	1 ⊢ (Fmla‘ω) = ∪ 𝑛 ∈ ω (Fmla‘𝑛)

Syntax hints:   ∧ wa 400   ∨ wo 860   = wceq 1563   ∈ wcel 2145  ∃wrex 3089  Vcvv 3457   ∪ cun 3905  ∅c0 4288  ∪ ciun 4952  {copab 5167   ↦ cmpt 5186  dom cdm 5652  Lim wlim 6351  suc csuc 6352  ‘cfv 6525  (class class class)co 7400  ωcom 7850  1^st c1st 7972  reccrdg 8384  ∈_𝑔cgoe 35696  ⊼_𝑔cgna 35697  ∀_𝑔cgol 35698   Sat csat 35699  Fmlacfmla 35700

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-inf2 9598

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-1st 7974  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-map 8814  df-sat 35706  df-fmla 35708

This theorem is referenced by:  fmlan0  35754  satfun  35774