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

Theorem acexmidlemab 6079
Description: Lemma for acexmid 6084. (Contributed by Jim Kingdon, 6-Aug-2019.)
Hypotheses
Ref Expression
acexmidlem.a 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
acexmidlem.b 𝐵 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)}
acexmidlem.c 𝐶 = {𝐴, 𝐵}
Assertion
Ref Expression
acexmidlemab (((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}) → ¬ 𝜑)
Distinct variable groups:   𝑥,𝑦,𝑣,𝑢,𝐴   𝑥,𝐵,𝑦,𝑣,𝑢   𝑥,𝐶,𝑦,𝑣,𝑢   𝜑,𝑥,𝑦,𝑣,𝑢

Proof of Theorem acexmidlemab
StepHypRef Expression
1 noel 3525 . . . 4 ¬ ∅ ∈ ∅
2 0ex 4260 . . . . . 6 ∅ ∈ V
32snid 3740 . . . . 5 ∅ ∈ {∅}
4 eleq2 2302 . . . . 5 (∅ = {∅} → (∅ ∈ ∅ ↔ ∅ ∈ {∅}))
53, 4mpbiri 168 . . . 4 (∅ = {∅} → ∅ ∈ ∅)
61, 5mto 672 . . 3 ¬ ∅ = {∅}
7 acexmidlem.a . . . . . . . . . 10 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
8 acexmidlem.b . . . . . . . . . 10 𝐵 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)}
9 acexmidlem.c . . . . . . . . . 10 𝐶 = {𝐴, 𝐵}
107, 8, 9acexmidlemph 6078 . . . . . . . . 9 (𝜑 → 𝐴 = 𝐵)
11 id 19 . . . . . . . . . 10 (𝐴 = 𝐵 → 𝐴 = 𝐵)
12 eleq1 2301 . . . . . . . . . . . 12 (𝐴 = 𝐵 → (𝐴 ∈ 𝑢 ↔ 𝐵 ∈ 𝑢))
1312anbi1d 469 . . . . . . . . . . 11 (𝐴 = 𝐵 → ((𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
1413rexbidv 2551 . . . . . . . . . 10 (𝐴 = 𝐵 → (∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
1511, 14riotaeqbidv 6041 . . . . . . . . 9 (𝐴 = 𝐵 → (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
1610, 15syl 14 . . . . . . . 8 (𝜑 → (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
1716eqeq1d 2247 . . . . . . 7 (𝜑 → ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ↔ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅))
1817biimpa 296 . . . . . 6 ((𝜑 ∧ (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅) → (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅)
1918adantrr 483 . . . . 5 ((𝜑 ∧ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) → (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅)
20 simprr 537 . . . . 5 ((𝜑 ∧ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) → (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})
2119, 20eqtr3d 2273 . . . 4 ((𝜑 ∧ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) → ∅ = {∅})
2221ex 115 . . 3 (𝜑 → (((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}) → ∅ = {∅}))
236, 22mtoi 674 . 2 (𝜑 → ¬ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))
2423con2i 636 1 (((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}) → ¬ 𝜑)
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 720   = wceq 1402   ∈ wcel 2209  ∃wrex 2529  {crab 2532  ∅c0 3520  {csn 3709  {cpr 3710  ℩crio 6037
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-ext 2220  ax-nul 4259
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-nul 3521  df-sn 3715  df-uni 3936  df-iota 5337  df-riota 6038
This theorem is used by:  acexmidlem1  6081
  Copyright terms: Public domain W3C validator