Theorem isfmlasuc 35393

Description: The characterization of a Godel formula of height at least 1. (Contributed by AV, 14-Oct-2023.)

Assertion

Ref	Expression
isfmlasuc	⊢ ((𝑁 ∈ ω ∧ 𝐹 ∈ 𝑉) → (𝐹 ∈ (Fmla‘suc 𝑁) ↔ (𝐹 ∈ (Fmla‘𝑁) ∨ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝐹 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝐹 = ∀𝑔𝑖𝑢))))

Distinct variable groups:   𝑖,𝐹,𝑢,𝑣   𝑖,𝑁,𝑢,𝑣

Allowed substitution hints:   𝑉(𝑣,𝑢,𝑖)

Proof of Theorem isfmlasuc

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fmlasuc 35391	. . . 4 ⊢ (𝑁 ∈ ω → (Fmla‘suc 𝑁) = ((Fmla‘𝑁) ∪ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)}))
2	1	adantr 480	. . 3 ⊢ ((𝑁 ∈ ω ∧ 𝐹 ∈ 𝑉) → (Fmla‘suc 𝑁) = ((Fmla‘𝑁) ∪ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)}))
3	2	eleq2d 2827	. 2 ⊢ ((𝑁 ∈ ω ∧ 𝐹 ∈ 𝑉) → (𝐹 ∈ (Fmla‘suc 𝑁) ↔ 𝐹 ∈ ((Fmla‘𝑁) ∪ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)})))
4		elun 4153	. . 3 ⊢ (𝐹 ∈ ((Fmla‘𝑁) ∪ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)}) ↔ (𝐹 ∈ (Fmla‘𝑁) ∨ 𝐹 ∈ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)}))
5	4	a1i 11	. 2 ⊢ ((𝑁 ∈ ω ∧ 𝐹 ∈ 𝑉) → (𝐹 ∈ ((Fmla‘𝑁) ∪ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)}) ↔ (𝐹 ∈ (Fmla‘𝑁) ∨ 𝐹 ∈ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)})))
6		eqeq1 2741	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓 = (𝑢⊼𝑔𝑣) ↔ 𝐹 = (𝑢⊼𝑔𝑣)))
7	6	rexbidv 3179	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ↔ ∃𝑣 ∈ (Fmla‘𝑁)𝐹 = (𝑢⊼𝑔𝑣)))
8		eqeq1 2741	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓 = ∀𝑔𝑖𝑢 ↔ 𝐹 = ∀𝑔𝑖𝑢))
9	8	rexbidv 3179	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢 ↔ ∃𝑖 ∈ ω 𝐹 = ∀𝑔𝑖𝑢))
10	7, 9	orbi12d 919	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢) ↔ (∃𝑣 ∈ (Fmla‘𝑁)𝐹 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝐹 = ∀𝑔𝑖𝑢)))
11	10	rexbidv 3179	. . . . 5 ⊢ (𝑓 = 𝐹 → (∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢) ↔ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝐹 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝐹 = ∀𝑔𝑖𝑢)))
12	11	elabg 3676	. . . 4 ⊢ (𝐹 ∈ 𝑉 → (𝐹 ∈ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)} ↔ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝐹 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝐹 = ∀𝑔𝑖𝑢)))
13	12	adantl 481	. . 3 ⊢ ((𝑁 ∈ ω ∧ 𝐹 ∈ 𝑉) → (𝐹 ∈ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)} ↔ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝐹 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝐹 = ∀𝑔𝑖𝑢)))
14	13	orbi2d 916	. 2 ⊢ ((𝑁 ∈ ω ∧ 𝐹 ∈ 𝑉) → ((𝐹 ∈ (Fmla‘𝑁) ∨ 𝐹 ∈ {𝑓 ∣ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝑓 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝑓 = ∀𝑔𝑖𝑢)}) ↔ (𝐹 ∈ (Fmla‘𝑁) ∨ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝐹 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝐹 = ∀𝑔𝑖𝑢))))
15	3, 5, 14	3bitrd 305	1 ⊢ ((𝑁 ∈ ω ∧ 𝐹 ∈ 𝑉) → (𝐹 ∈ (Fmla‘suc 𝑁) ↔ (𝐹 ∈ (Fmla‘𝑁) ∨ ∃𝑢 ∈ (Fmla‘𝑁)(∃𝑣 ∈ (Fmla‘𝑁)𝐹 = (𝑢⊼𝑔𝑣) ∨ ∃𝑖 ∈ ω 𝐹 = ∀𝑔𝑖𝑢))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   = wceq 1540   ∈ wcel 2108  {cab 2714  ∃wrex 3070   ∪ cun 3949  suc csuc 6386  ‘cfv 6561  (class class class)co 7431  ωcom 7887  ⊼_𝑔cgna 35339  ∀_𝑔cgol 35340  Fmlacfmla 35342

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

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-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-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-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-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-map 8868  df-goel 35345  df-goal 35347  df-sat 35348  df-fmla 35350

This theorem is referenced by:  gonarlem  35399  gonar  35400  goalrlem  35401  goalr  35402  fmlasucdisj  35404