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

Theorem reg3exmidlemwe 4701
Description: Lemma for reg3exmid 4702. Our counterexample 𝐴 satisfies We. (Contributed by Jim Kingdon, 3-Oct-2021.)
Hypothesis
Ref Expression
reg3exmidlemwe.a 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))}
Assertion
Ref Expression
reg3exmidlemwe E We 𝐴
Distinct variable group:   𝜑,𝑥
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem reg3exmidlemwe
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 zfregfr 4696 . 2 E Fr 𝐴
2 epel 4413 . . . . . 6 (𝑎 E 𝑏𝑎𝑏)
3 epel 4413 . . . . . 6 (𝑏 E 𝑐𝑏𝑐)
42, 3anbi12i 460 . . . . 5 ((𝑎 E 𝑏𝑏 E 𝑐) ↔ (𝑎𝑏𝑏𝑐))
5 simpr 110 . . . . . 6 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → (𝑎𝑏𝑏𝑐))
6 elirr 4663 . . . . . . . 8 ¬ {∅} ∈ {∅}
7 simprr 533 . . . . . . . . . 10 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑏𝑐)
8 noel 3512 . . . . . . . . . . . . 13 ¬ 𝑎 ∈ ∅
9 eleq2 2296 . . . . . . . . . . . . 13 (𝑏 = ∅ → (𝑎𝑏𝑎 ∈ ∅))
108, 9mtbiri 682 . . . . . . . . . . . 12 (𝑏 = ∅ → ¬ 𝑎𝑏)
11 simprl 531 . . . . . . . . . . . 12 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑎𝑏)
1210, 11nsyl3 631 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → ¬ 𝑏 = ∅)
13 elrabi 2970 . . . . . . . . . . . . . . . 16 (𝑏 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))} → 𝑏 ∈ {∅, {∅}})
14 reg3exmidlemwe.a . . . . . . . . . . . . . . . 16 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))}
1513, 14eleq2s 2327 . . . . . . . . . . . . . . 15 (𝑏𝐴𝑏 ∈ {∅, {∅}})
16 elpri 3712 . . . . . . . . . . . . . . 15 (𝑏 ∈ {∅, {∅}} → (𝑏 = ∅ ∨ 𝑏 = {∅}))
1715, 16syl 14 . . . . . . . . . . . . . 14 (𝑏𝐴 → (𝑏 = ∅ ∨ 𝑏 = {∅}))
1817orcomd 737 . . . . . . . . . . . . 13 (𝑏𝐴 → (𝑏 = {∅} ∨ 𝑏 = ∅))
19183ad2ant2 1046 . . . . . . . . . . . 12 ((𝑎𝐴𝑏𝐴𝑐𝐴) → (𝑏 = {∅} ∨ 𝑏 = ∅))
2019adantr 276 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → (𝑏 = {∅} ∨ 𝑏 = ∅))
2112, 20ecased 1386 . . . . . . . . . 10 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑏 = {∅})
22 noel 3512 . . . . . . . . . . . . 13 ¬ 𝑏 ∈ ∅
23 eleq2 2296 . . . . . . . . . . . . 13 (𝑐 = ∅ → (𝑏𝑐𝑏 ∈ ∅))
2422, 23mtbiri 682 . . . . . . . . . . . 12 (𝑐 = ∅ → ¬ 𝑏𝑐)
2524, 7nsyl3 631 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → ¬ 𝑐 = ∅)
26 elrabi 2970 . . . . . . . . . . . . . . . 16 (𝑐 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))} → 𝑐 ∈ {∅, {∅}})
2726, 14eleq2s 2327 . . . . . . . . . . . . . . 15 (𝑐𝐴𝑐 ∈ {∅, {∅}})
28 vex 2816 . . . . . . . . . . . . . . . 16 𝑐 ∈ V
2928elpr 3710 . . . . . . . . . . . . . . 15 (𝑐 ∈ {∅, {∅}} ↔ (𝑐 = ∅ ∨ 𝑐 = {∅}))
3027, 29sylib 122 . . . . . . . . . . . . . 14 (𝑐𝐴 → (𝑐 = ∅ ∨ 𝑐 = {∅}))
3130orcomd 737 . . . . . . . . . . . . 13 (𝑐𝐴 → (𝑐 = {∅} ∨ 𝑐 = ∅))
32313ad2ant3 1047 . . . . . . . . . . . 12 ((𝑎𝐴𝑏𝐴𝑐𝐴) → (𝑐 = {∅} ∨ 𝑐 = ∅))
3332adantr 276 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → (𝑐 = {∅} ∨ 𝑐 = ∅))
3425, 33ecased 1386 . . . . . . . . . 10 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑐 = {∅})
357, 21, 343eltr3d 2315 . . . . . . . . 9 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → {∅} ∈ {∅})
3635ex 115 . . . . . . . 8 ((𝑎𝐴𝑏𝐴𝑐𝐴) → ((𝑎𝑏𝑏𝑐) → {∅} ∈ {∅}))
376, 36mtoi 670 . . . . . . 7 ((𝑎𝐴𝑏𝐴𝑐𝐴) → ¬ (𝑎𝑏𝑏𝑐))
3837adantr 276 . . . . . 6 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → ¬ (𝑎𝑏𝑏𝑐))
395, 38pm2.21dd 625 . . . . 5 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑎 E 𝑐)
404, 39sylan2b 287 . . . 4 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎 E 𝑏𝑏 E 𝑐)) → 𝑎 E 𝑐)
4140ex 115 . . 3 ((𝑎𝐴𝑏𝐴𝑐𝐴) → ((𝑎 E 𝑏𝑏 E 𝑐) → 𝑎 E 𝑐))
4241rgen3 2629 . 2 𝑎𝐴𝑏𝐴𝑐𝐴 ((𝑎 E 𝑏𝑏 E 𝑐) → 𝑎 E 𝑐)
43 df-wetr 4455 . 2 ( E We 𝐴 ↔ ( E Fr 𝐴 ∧ ∀𝑎𝐴𝑏𝐴𝑐𝐴 ((𝑎 E 𝑏𝑏 E 𝑐) → 𝑎 E 𝑐)))
441, 42, 43mpbir2an 951 1 E We 𝐴
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 716  w3a 1005   = wceq 1398  wcel 2203  wral 2520  {crab 2524  c0 3508  {csn 3689  {cpr 3690   class class class wbr 4109   E cep 4408   Fr wfr 4449   We wwe 4451
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-setind 4659
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rab 2529  df-v 2815  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-br 4110  df-opab 4172  df-eprel 4410  df-frfor 4452  df-frind 4453  df-wetr 4455
This theorem is referenced by:  reg3exmid  4702
  Copyright terms: Public domain W3C validator