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

Theorem acexmidlem2 6082
Description: Lemma for acexmid 6084. This builds on acexmidlem1 6081 by noting that every element of 𝐶 is inhabited.

(Note that 𝑦 is not quite a function in the df-fun 5379 sense because it uses ordered pairs as described in opthreg 4703 rather than df-op 3718).

The set 𝐴 is also found in onsucelsucexmidlem 4676.

(Contributed by Jim Kingdon, 5-Aug-2019.)

Hypotheses
Ref Expression
acexmidlem.a 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
acexmidlem.b 𝐵 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)}
acexmidlem.c 𝐶 = {𝐴, 𝐵}
Assertion
Ref Expression
acexmidlem2 (∀𝑧 ∈ 𝐶 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (𝜑 ∨ ¬ 𝜑))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝐶,𝑦,𝑧,𝑤,𝑣,𝑢   𝜑,𝑥,𝑦,𝑧,𝑤,𝑣,𝑢

Proof of Theorem acexmidlem2
StepHypRef Expression
1 df-ral 2533 . . . . 5 (∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∀𝑤(𝑤 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
2 19.23v 1936 . . . . 5 (∀𝑤(𝑤 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ↔ (∃𝑤 𝑤 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
31, 2bitr2i 185 . . . 4 ((∃𝑤 𝑤 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ↔ ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
4 acexmidlem.c . . . . . . . . 9 𝐶 = {𝐴, 𝐵}
54eleq2i 2305 . . . . . . . 8 (𝑧 ∈ 𝐶 ↔ 𝑧 ∈ {𝐴, 𝐵})
6 vex 2824 . . . . . . . . 9 𝑧 ∈ V
76elpr 3730 . . . . . . . 8 (𝑧 ∈ {𝐴, 𝐵} ↔ (𝑧 = 𝐴 ∨ 𝑧 = 𝐵))
85, 7bitri 184 . . . . . . 7 (𝑧 ∈ 𝐶 ↔ (𝑧 = 𝐴 ∨ 𝑧 = 𝐵))
9 onsucelsucexmidlem1 4675 . . . . . . . . . . 11 ∅ ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
10 acexmidlem.a . . . . . . . . . . 11 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
119, 10eleqtrri 2314 . . . . . . . . . 10 ∅ ∈ 𝐴
12 elex2 2838 . . . . . . . . . 10 (∅ ∈ 𝐴 → ∃𝑤 𝑤 ∈ 𝐴)
1311, 12ax-mp 5 . . . . . . . . 9 ∃𝑤 𝑤 ∈ 𝐴
14 eleq2 2302 . . . . . . . . . 10 (𝑧 = 𝐴 → (𝑤 ∈ 𝑧 ↔ 𝑤 ∈ 𝐴))
1514exbidv 1878 . . . . . . . . 9 (𝑧 = 𝐴 → (∃𝑤 𝑤 ∈ 𝑧 ↔ ∃𝑤 𝑤 ∈ 𝐴))
1613, 15mpbiri 168 . . . . . . . 8 (𝑧 = 𝐴 → ∃𝑤 𝑤 ∈ 𝑧)
17 p0ex 4325 . . . . . . . . . . . . 13 {∅} ∈ V
1817prid2 3818 . . . . . . . . . . . 12 {∅} ∈ {∅, {∅}}
19 eqid 2238 . . . . . . . . . . . . 13 {∅} = {∅}
2019orci 743 . . . . . . . . . . . 12 ({∅} = {∅} ∨ 𝜑)
21 eqeq1 2245 . . . . . . . . . . . . . 14 (𝑥 = {∅} → (𝑥 = {∅} ↔ {∅} = {∅}))
2221orbi1d 803 . . . . . . . . . . . . 13 (𝑥 = {∅} → ((𝑥 = {∅} ∨ 𝜑) ↔ ({∅} = {∅} ∨ 𝜑)))
2322elrab 2982 . . . . . . . . . . . 12 ({∅} ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)} ↔ ({∅} ∈ {∅, {∅}} ∧ ({∅} = {∅} ∨ 𝜑)))
2418, 20, 23mpbir2an 955 . . . . . . . . . . 11 {∅} ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)}
25 acexmidlem.b . . . . . . . . . . 11 𝐵 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)}
2624, 25eleqtrri 2314 . . . . . . . . . 10 {∅} ∈ 𝐵
27 elex2 2838 . . . . . . . . . 10 ({∅} ∈ 𝐵 → ∃𝑤 𝑤 ∈ 𝐵)
2826, 27ax-mp 5 . . . . . . . . 9 ∃𝑤 𝑤 ∈ 𝐵
29 eleq2 2302 . . . . . . . . . 10 (𝑧 = 𝐵 → (𝑤 ∈ 𝑧 ↔ 𝑤 ∈ 𝐵))
3029exbidv 1878 . . . . . . . . 9 (𝑧 = 𝐵 → (∃𝑤 𝑤 ∈ 𝑧 ↔ ∃𝑤 𝑤 ∈ 𝐵))
3128, 30mpbiri 168 . . . . . . . 8 (𝑧 = 𝐵 → ∃𝑤 𝑤 ∈ 𝑧)
3216, 31jaoi 728 . . . . . . 7 ((𝑧 = 𝐴 ∨ 𝑧 = 𝐵) → ∃𝑤 𝑤 ∈ 𝑧)
338, 32sylbi 121 . . . . . 6 (𝑧 ∈ 𝐶 → ∃𝑤 𝑤 ∈ 𝑧)
34 pm2.27 40 . . . . . 6 (∃𝑤 𝑤 ∈ 𝑧 → ((∃𝑤 𝑤 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
3533, 34syl 14 . . . . 5 (𝑧 ∈ 𝐶 → ((∃𝑤 𝑤 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
3635imp 124 . . . 4 ((𝑧 ∈ 𝐶 ∧ (∃𝑤 𝑤 ∈ 𝑧 → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))) → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
373, 36sylan2br 288 . . 3 ((𝑧 ∈ 𝐶 ∧ ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) → ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
3837ralimiaa 2612 . 2 (∀𝑧 ∈ 𝐶 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
3910, 25, 4acexmidlem1 6081 . 2 (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (𝜑 ∨ ¬ 𝜑))
4038, 39syl 14 1 (∀𝑧 ∈ 𝐶 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (𝜑 ∨ ¬ 𝜑))
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 720  ∀wal 1400   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  ∃!wreu 2530  {crab 2532  ∅c0 3520  {csn 3709  {cpr 3710
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-uni 3936  df-tr 4230  df-iord 4511  df-on 4513  df-suc 4516  df-iota 5337  df-riota 6038
This theorem is used by:  acexmidlemv  6083
  Copyright terms: Public domain W3C validator