Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  acexmidlemv GIF version

Theorem acexmidlemv 5561
 Description: Lemma for acexmid 5562. This is acexmid 5562 with additional distinct variable constraints, most notably between 𝜑 and 𝑥. (Contributed by Jim Kingdon, 6-Aug-2019.)
Hypothesis
Ref Expression
acexmidlemv.choice 𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢)
Assertion
Ref Expression
acexmidlemv (𝜑 ∨ ¬ 𝜑)
Distinct variable group:   𝜑,𝑥,𝑦,𝑧,𝑤,𝑣,𝑢

Proof of Theorem acexmidlemv
Dummy variables 𝑠 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 onsucelsucexmidlem 4300 . . . 4 {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)} ∈ On
2 pp0ex 3980 . . . . 5 {∅, {∅}} ∈ V
32rabex 3942 . . . 4 {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)} ∈ V
4 prexg 3994 . . . 4 (({𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)} ∈ On ∧ {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)} ∈ V) → {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}} ∈ V)
51, 3, 4mp2an 417 . . 3 {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}} ∈ V
6 raleq 2554 . . . 4 (𝑥 = {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}} → (∀𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢) ↔ ∀𝑧 ∈ {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}}∀𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢)))
76exbidv 1748 . . 3 (𝑥 = {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}} → (∃𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢) ↔ ∃𝑦𝑧 ∈ {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}}∀𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢)))
8 acexmidlemv.choice . . 3 𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢)
95, 7, 8vtocl 2662 . 2 𝑦𝑧 ∈ {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}}∀𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢)
10 eqeq1 2089 . . . . . 6 (𝑠 = 𝑡 → (𝑠 = ∅ ↔ 𝑡 = ∅))
1110orbi1d 738 . . . . 5 (𝑠 = 𝑡 → ((𝑠 = ∅ ∨ 𝜑) ↔ (𝑡 = ∅ ∨ 𝜑)))
1211cbvrabv 2609 . . . 4 {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)} = {𝑡 ∈ {∅, {∅}} ∣ (𝑡 = ∅ ∨ 𝜑)}
13 eqeq1 2089 . . . . . 6 (𝑠 = 𝑡 → (𝑠 = {∅} ↔ 𝑡 = {∅}))
1413orbi1d 738 . . . . 5 (𝑠 = 𝑡 → ((𝑠 = {∅} ∨ 𝜑) ↔ (𝑡 = {∅} ∨ 𝜑)))
1514cbvrabv 2609 . . . 4 {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)} = {𝑡 ∈ {∅, {∅}} ∣ (𝑡 = {∅} ∨ 𝜑)}
16 eqid 2083 . . . 4 {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}} = {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}}
1712, 15, 16acexmidlem2 5560 . . 3 (∀𝑧 ∈ {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}}∀𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢) → (𝜑 ∨ ¬ 𝜑))
1817exlimiv 1530 . 2 (∃𝑦𝑧 ∈ {{𝑠 ∈ {∅, {∅}} ∣ (𝑠 = ∅ ∨ 𝜑)}, {𝑠 ∈ {∅, {∅}} ∣ (𝑠 = {∅} ∨ 𝜑)}}∀𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢) → (𝜑 ∨ ¬ 𝜑))
199, 18ax-mp 7 1 (𝜑 ∨ ¬ 𝜑)
 Colors of variables: wff set class Syntax hints:  ¬ wn 3   ∧ wa 102   ∨ wo 662   = wceq 1285  ∃wex 1422   ∈ wcel 1434  ∀wral 2353  ∃wrex 2354  ∃!wreu 2355  {crab 2357  Vcvv 2610  ∅c0 3267  {csn 3416  {cpr 3417  Oncon0 4146 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3916  ax-nul 3924  ax-pow 3968  ax-pr 3992 This theorem depends on definitions:  df-bi 115  df-3or 921  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1688  df-eu 1946  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rex 2359  df-reu 2360  df-rab 2362  df-v 2612  df-sbc 2825  df-dif 2984  df-un 2986  df-in 2988  df-ss 2995  df-nul 3268  df-pw 3402  df-sn 3422  df-pr 3423  df-uni 3622  df-tr 3896  df-iord 4149  df-on 4151  df-suc 4154  df-iota 4917  df-riota 5519 This theorem is referenced by:  acexmid  5562
 Copyright terms: Public domain W3C validator