Theorem satfrel 35361

Description: The value of the satisfaction predicate as function over wff codes at a natural number is a relation. (Contributed by AV, 12-Oct-2023.)

Assertion

Ref	Expression
satfrel	⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊 ∧ 𝑁 ∈ ω) → Rel ((𝑀 Sat 𝐸)‘𝑁))

Proof of Theorem satfrel

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

Step	Hyp	Ref	Expression
1		fveq2 6861	. . . . . 6 ⊢ (𝑎 = ∅ → ((𝑀 Sat 𝐸)‘𝑎) = ((𝑀 Sat 𝐸)‘∅))
2	1	releqd 5744	. . . . 5 ⊢ (𝑎 = ∅ → (Rel ((𝑀 Sat 𝐸)‘𝑎) ↔ Rel ((𝑀 Sat 𝐸)‘∅)))
3	2	imbi2d 340	. . . 4 ⊢ (𝑎 = ∅ → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑎)) ↔ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘∅))))
4		fveq2 6861	. . . . . 6 ⊢ (𝑎 = 𝑏 → ((𝑀 Sat 𝐸)‘𝑎) = ((𝑀 Sat 𝐸)‘𝑏))
5	4	releqd 5744	. . . . 5 ⊢ (𝑎 = 𝑏 → (Rel ((𝑀 Sat 𝐸)‘𝑎) ↔ Rel ((𝑀 Sat 𝐸)‘𝑏)))
6	5	imbi2d 340	. . . 4 ⊢ (𝑎 = 𝑏 → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑎)) ↔ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑏))))
7		fveq2 6861	. . . . . 6 ⊢ (𝑎 = suc 𝑏 → ((𝑀 Sat 𝐸)‘𝑎) = ((𝑀 Sat 𝐸)‘suc 𝑏))
8	7	releqd 5744	. . . . 5 ⊢ (𝑎 = suc 𝑏 → (Rel ((𝑀 Sat 𝐸)‘𝑎) ↔ Rel ((𝑀 Sat 𝐸)‘suc 𝑏)))
9	8	imbi2d 340	. . . 4 ⊢ (𝑎 = suc 𝑏 → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑎)) ↔ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘suc 𝑏))))
10		fveq2 6861	. . . . . 6 ⊢ (𝑎 = 𝑁 → ((𝑀 Sat 𝐸)‘𝑎) = ((𝑀 Sat 𝐸)‘𝑁))
11	10	releqd 5744	. . . . 5 ⊢ (𝑎 = 𝑁 → (Rel ((𝑀 Sat 𝐸)‘𝑎) ↔ Rel ((𝑀 Sat 𝐸)‘𝑁)))
12	11	imbi2d 340	. . . 4 ⊢ (𝑎 = 𝑁 → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑎)) ↔ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑁))))
13		relopabv 5787	. . . . 5 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ ∃𝑖 ∈ ω ∃𝑗 ∈ ω (𝑥 = (𝑖∈𝑔𝑗) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘𝑖)𝐸(𝑎‘𝑗)})}
14		eqid 2730	. . . . . . 7 ⊢ (𝑀 Sat 𝐸) = (𝑀 Sat 𝐸)
15	14	satfv0 35352	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → ((𝑀 Sat 𝐸)‘∅) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑖 ∈ ω ∃𝑗 ∈ ω (𝑥 = (𝑖∈𝑔𝑗) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘𝑖)𝐸(𝑎‘𝑗)})})
16	15	releqd 5744	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → (Rel ((𝑀 Sat 𝐸)‘∅) ↔ Rel {⟨𝑥, 𝑦⟩ ∣ ∃𝑖 ∈ ω ∃𝑗 ∈ ω (𝑥 = (𝑖∈𝑔𝑗) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘𝑖)𝐸(𝑎‘𝑗)})}))
17	13, 16	mpbiri 258	. . . 4 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘∅))
18		pm2.27 42	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑏)) → Rel ((𝑀 Sat 𝐸)‘𝑏)))
19		simpr 484	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑏 ∈ ω) ∧ Rel ((𝑀 Sat 𝐸)‘𝑏)) → Rel ((𝑀 Sat 𝐸)‘𝑏))
20		relopabv 5787	. . . . . . . . . 10 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}
21		relun 5777	. . . . . . . . . 10 ⊢ (Rel (((𝑀 Sat 𝐸)‘𝑏) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}) ↔ (Rel ((𝑀 Sat 𝐸)‘𝑏) ∧ Rel {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}))
22	19, 20, 21	sylanblrc 590	. . . . . . . . 9 ⊢ ((((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑏 ∈ ω) ∧ Rel ((𝑀 Sat 𝐸)‘𝑏)) → Rel (((𝑀 Sat 𝐸)‘𝑏) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}))
23	14	satfvsuc 35355	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊 ∧ 𝑏 ∈ ω) → ((𝑀 Sat 𝐸)‘suc 𝑏) = (((𝑀 Sat 𝐸)‘𝑏) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}))
24	23	ad4ant123 1173	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑏 ∈ ω) ∧ Rel ((𝑀 Sat 𝐸)‘𝑏)) → ((𝑀 Sat 𝐸)‘suc 𝑏) = (((𝑀 Sat 𝐸)‘𝑏) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}))
25	24	releqd 5744	. . . . . . . . 9 ⊢ ((((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑏 ∈ ω) ∧ Rel ((𝑀 Sat 𝐸)‘𝑏)) → (Rel ((𝑀 Sat 𝐸)‘suc 𝑏) ↔ Rel (((𝑀 Sat 𝐸)‘𝑏) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))})))
26	22, 25	mpbird 257	. . . . . . . 8 ⊢ ((((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑏 ∈ ω) ∧ Rel ((𝑀 Sat 𝐸)‘𝑏)) → Rel ((𝑀 Sat 𝐸)‘suc 𝑏))
27	26	exp31 419	. . . . . . 7 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → (𝑏 ∈ ω → (Rel ((𝑀 Sat 𝐸)‘𝑏) → Rel ((𝑀 Sat 𝐸)‘suc 𝑏))))
28	27	com23 86	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → (Rel ((𝑀 Sat 𝐸)‘𝑏) → (𝑏 ∈ ω → Rel ((𝑀 Sat 𝐸)‘suc 𝑏))))
29	18, 28	syld 47	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑏)) → (𝑏 ∈ ω → Rel ((𝑀 Sat 𝐸)‘suc 𝑏))))
30	29	com13 88	. . . 4 ⊢ (𝑏 ∈ ω → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑏)) → ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘suc 𝑏))))
31	3, 6, 9, 12, 17, 30	finds 7875	. . 3 ⊢ (𝑁 ∈ ω → ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑁)))
32	31	com12 32	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → (𝑁 ∈ ω → Rel ((𝑀 Sat 𝐸)‘𝑁)))
33	32	3impia 1117	1 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊 ∧ 𝑁 ∈ ω) → Rel ((𝑀 Sat 𝐸)‘𝑁))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3045  ∃wrex 3054  {crab 3408   ∖ cdif 3914   ∪ cun 3915   ∩ cin 3916  ∅c0 4299  {csn 4592  ⟨cop 4598   class class class wbr 5110  {copab 5172   ↾ cres 5643  Rel wrel 5646  suc csuc 6337  ‘cfv 6514  (class class class)co 7390  ωcom 7845  1^st c1st 7969  2^nd c2nd 7970   ↑_m cmap 8802  ∈_𝑔cgoe 35327  ⊼_𝑔cgna 35328  ∀_𝑔cgol 35329   Sat csat 35330

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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-inf2 9601

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-goel 35334  df-sat 35337

This theorem is referenced by:  satfdmlem  35362  satffunlem1lem2  35397  satffunlem2lem2  35400