![]() |
Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > satf00 | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
satf00 | ⊢ ((∅ Sat ∅)‘∅) = {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | peano1 7921 | . . 3 ⊢ ∅ ∈ ω | |
2 | elelsuc 6463 | . . 3 ⊢ (∅ ∈ ω → ∅ ∈ suc ω) | |
3 | satf0sucom 35333 | . . 3 ⊢ (∅ ∈ suc ω → ((∅ Sat ∅)‘∅) = (rec((𝑓 ∈ V ↦ (𝑓 ∪ {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘∅)) | |
4 | 1, 2, 3 | mp2b 10 | . 2 ⊢ ((∅ Sat ∅)‘∅) = (rec((𝑓 ∈ V ↦ (𝑓 ∪ {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘∅) |
5 | omex 9706 | . . . 4 ⊢ ω ∈ V | |
6 | 5, 5 | xpex 7782 | . . . 4 ⊢ (ω × ω) ∈ V |
7 | xpexg 7779 | . . . . 5 ⊢ ((ω ∈ V ∧ (ω × ω) ∈ V) → (ω × (ω × ω)) ∈ V) | |
8 | simpl 482 | . . . . 5 ⊢ ((ω ∈ V ∧ (ω × ω) ∈ V) → ω ∈ V) | |
9 | goelel3xp 35308 | . . . . . . . 8 ⊢ ((𝑖 ∈ ω ∧ 𝑗 ∈ ω) → (𝑖∈𝑔𝑗) ∈ (ω × (ω × ω))) | |
10 | eleq1 2832 | . . . . . . . 8 ⊢ (𝑥 = (𝑖∈𝑔𝑗) → (𝑥 ∈ (ω × (ω × ω)) ↔ (𝑖∈𝑔𝑗) ∈ (ω × (ω × ω)))) | |
11 | 9, 10 | syl5ibrcom 247 | . . . . . . 7 ⊢ ((𝑖 ∈ ω ∧ 𝑗 ∈ ω) → (𝑥 = (𝑖∈𝑔𝑗) → 𝑥 ∈ (ω × (ω × ω)))) |
12 | 11 | rexlimivv 3207 | . . . . . 6 ⊢ (∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗) → 𝑥 ∈ (ω × (ω × ω))) |
13 | 12 | ad2antll 728 | . . . . 5 ⊢ (((ω ∈ V ∧ (ω × ω) ∈ V) ∧ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))) → 𝑥 ∈ (ω × (ω × ω))) |
14 | eleq1 2832 | . . . . . . 7 ⊢ (𝑦 = ∅ → (𝑦 ∈ ω ↔ ∅ ∈ ω)) | |
15 | 1, 14 | mpbiri 258 | . . . . . 6 ⊢ (𝑦 = ∅ → 𝑦 ∈ ω) |
16 | 15 | ad2antrl 727 | . . . . 5 ⊢ (((ω ∈ V ∧ (ω × ω) ∈ V) ∧ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))) → 𝑦 ∈ ω) |
17 | 7, 8, 13, 16 | opabex2 8092 | . . . 4 ⊢ ((ω ∈ V ∧ (ω × ω) ∈ V) → {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))} ∈ V) |
18 | 5, 6, 17 | mp2an 691 | . . 3 ⊢ {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))} ∈ V |
19 | 18 | rdg0 8471 | . 2 ⊢ (rec((𝑓 ∈ V ↦ (𝑓 ∪ {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑢 ∈ 𝑓 (∃𝑣 ∈ 𝑓 𝑥 = ((1st ‘𝑢)⊼𝑔(1st ‘𝑣)) ∨ ∃𝑖 ∈ ω 𝑥 = ∀𝑔𝑖(1st ‘𝑢)))})), {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))})‘∅) = {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))} |
20 | 4, 19 | eqtri 2768 | 1 ⊢ ((∅ Sat ∅)‘∅) = {〈𝑥, 𝑦〉 ∣ (𝑦 = ∅ ∧ ∃𝑖 ∈ ω ∃𝑗 ∈ ω 𝑥 = (𝑖∈𝑔𝑗))} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 395 ∨ wo 846 = wceq 1537 ∈ wcel 2108 ∃wrex 3076 Vcvv 3488 ∪ cun 3974 ∅c0 4352 {copab 5228 ↦ cmpt 5249 × cxp 5693 suc csuc 6392 ‘cfv 6568 (class class class)co 7443 ωcom 7897 1st c1st 8022 reccrdg 8459 ∈𝑔cgoe 35293 ⊼𝑔cgna 35294 ∀𝑔cgol 35295 Sat csat 35296 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7764 ax-inf2 9704 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5650 df-we 5652 df-xp 5701 df-rel 5702 df-cnv 5703 df-co 5704 df-dm 5705 df-rn 5706 df-res 5707 df-ima 5708 df-pred 6327 df-ord 6393 df-on 6394 df-lim 6395 df-suc 6396 df-iota 6520 df-fun 6570 df-fn 6571 df-f 6572 df-f1 6573 df-fo 6574 df-f1o 6575 df-fv 6576 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7898 df-1st 8024 df-2nd 8025 df-frecs 8316 df-wrecs 8347 df-recs 8421 df-rdg 8460 df-map 8880 df-goel 35300 df-sat 35303 |
This theorem is referenced by: satf0op 35337 satf0n0 35338 sat1el2xp 35339 fmla0 35342 fmlafvel 35345 |
Copyright terms: Public domain | W3C validator |