Theorem satfrel 35549

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 6840	. . . . . 6 ⊢ (𝑎 = ∅ → ((𝑀 Sat 𝐸)‘𝑎) = ((𝑀 Sat 𝐸)‘∅))
2	1	releqd 5735	. . . . 5 ⊢ (𝑎 = ∅ → (Rel ((𝑀 Sat 𝐸)‘𝑎) ↔ Rel ((𝑀 Sat 𝐸)‘∅)))
3	2	imbi2d 340	. . . 4 ⊢ (𝑎 = ∅ → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑎)) ↔ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘∅))))
4		fveq2 6840	. . . . . 6 ⊢ (𝑎 = 𝑏 → ((𝑀 Sat 𝐸)‘𝑎) = ((𝑀 Sat 𝐸)‘𝑏))
5	4	releqd 5735	. . . . 5 ⊢ (𝑎 = 𝑏 → (Rel ((𝑀 Sat 𝐸)‘𝑎) ↔ Rel ((𝑀 Sat 𝐸)‘𝑏)))
6	5	imbi2d 340	. . . 4 ⊢ (𝑎 = 𝑏 → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑎)) ↔ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑏))))
7		fveq2 6840	. . . . . 6 ⊢ (𝑎 = suc 𝑏 → ((𝑀 Sat 𝐸)‘𝑎) = ((𝑀 Sat 𝐸)‘suc 𝑏))
8	7	releqd 5735	. . . . 5 ⊢ (𝑎 = suc 𝑏 → (Rel ((𝑀 Sat 𝐸)‘𝑎) ↔ Rel ((𝑀 Sat 𝐸)‘suc 𝑏)))
9	8	imbi2d 340	. . . 4 ⊢ (𝑎 = suc 𝑏 → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑎)) ↔ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘suc 𝑏))))
10		fveq2 6840	. . . . . 6 ⊢ (𝑎 = 𝑁 → ((𝑀 Sat 𝐸)‘𝑎) = ((𝑀 Sat 𝐸)‘𝑁))
11	10	releqd 5735	. . . . 5 ⊢ (𝑎 = 𝑁 → (Rel ((𝑀 Sat 𝐸)‘𝑎) ↔ Rel ((𝑀 Sat 𝐸)‘𝑁)))
12	11	imbi2d 340	. . . 4 ⊢ (𝑎 = 𝑁 → (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑎)) ↔ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑁))))
13		relopabv 5777	. . . . 5 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ ∃𝑖 ∈ ω ∃𝑗 ∈ ω (𝑥 = (𝑖∈𝑔𝑗) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘𝑖)𝐸(𝑎‘𝑗)})}
14		eqid 2736	. . . . . . 7 ⊢ (𝑀 Sat 𝐸) = (𝑀 Sat 𝐸)
15	14	satfv0 35540	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → ((𝑀 Sat 𝐸)‘∅) = {⟨𝑥, 𝑦⟩ ∣ ∃𝑖 ∈ ω ∃𝑗 ∈ ω (𝑥 = (𝑖∈𝑔𝑗) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ (𝑎‘𝑖)𝐸(𝑎‘𝑗)})})
16	15	releqd 5735	. . . . 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 5777	. . . . . . . . . 10 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}
21		relun 5767	. . . . . . . . . 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 591	. . . . . . . . 9 ⊢ ((((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑏 ∈ ω) ∧ Rel ((𝑀 Sat 𝐸)‘𝑏)) → Rel (((𝑀 Sat 𝐸)‘𝑏) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}))
23	14	satfvsuc 35543	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊 ∧ 𝑏 ∈ ω) → ((𝑀 Sat 𝐸)‘suc 𝑏) = (((𝑀 Sat 𝐸)‘𝑏) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}))
24	23	ad4ant123 1174	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑏 ∈ ω) ∧ Rel ((𝑀 Sat 𝐸)‘𝑏)) → ((𝑀 Sat 𝐸)‘suc 𝑏) = (((𝑀 Sat 𝐸)‘𝑏) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ ((𝑀 Sat 𝐸)‘𝑏)(∃𝑣 ∈ ((𝑀 Sat 𝐸)‘𝑏)(𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑m ω) ∖ ((2nd ‘𝑢) ∩ (2nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀𝑔𝑖(1st ‘𝑢) ∧ 𝑦 = {𝑎 ∈ (𝑀 ↑m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑎 ↾ (ω ∖ {𝑖}))) ∈ (2nd ‘𝑢)}))}))
25	24	releqd 5735	. . . . . . . . 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 7847	. . 3 ⊢ (𝑁 ∈ ω → ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → Rel ((𝑀 Sat 𝐸)‘𝑁)))
32	31	com12 32	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) → (𝑁 ∈ ω → Rel ((𝑀 Sat 𝐸)‘𝑁)))
33	32	3impia 1118	1 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊 ∧ 𝑁 ∈ ω) → Rel ((𝑀 Sat 𝐸)‘𝑁))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3051  ∃wrex 3061  {crab 3389   ∖ cdif 3886   ∪ cun 3887   ∩ cin 3888  ∅c0 4273  {csn 4567  ⟨cop 4573   class class class wbr 5085  {copab 5147   ↾ cres 5633  Rel wrel 5636  suc csuc 6325  ‘cfv 6498  (class class class)co 7367  ωcom 7817  1^st c1st 7940  2^nd c2nd 7941   ↑_m cmap 8773  ∈_𝑔cgoe 35515  ⊼_𝑔cgna 35516  ∀_𝑔cgol 35517   Sat csat 35518

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-inf2 9562

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-goel 35522  df-sat 35525

This theorem is referenced by:  satfdmlem  35550  satffunlem1lem2  35585  satffunlem2lem2  35588