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

Theorem reg3exmidlemwe 4677
Description: Lemma for reg3exmid 4678. 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 4672 . 2 E Fr 𝐴
2 epel 4389 . . . . . 6 (𝑎 E 𝑏𝑎𝑏)
3 epel 4389 . . . . . 6 (𝑏 E 𝑐𝑏𝑐)
42, 3anbi12i 460 . . . . 5 ((𝑎 E 𝑏𝑏 E 𝑐) ↔ (𝑎𝑏𝑏𝑐))
5 simpr 110 . . . . . 6 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → (𝑎𝑏𝑏𝑐))
6 elirr 4639 . . . . . . . 8 ¬ {∅} ∈ {∅}
7 simprr 533 . . . . . . . . . 10 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑏𝑐)
8 noel 3498 . . . . . . . . . . . . 13 ¬ 𝑎 ∈ ∅
9 eleq2 2295 . . . . . . . . . . . . 13 (𝑏 = ∅ → (𝑎𝑏𝑎 ∈ ∅))
108, 9mtbiri 681 . . . . . . . . . . . 12 (𝑏 = ∅ → ¬ 𝑎𝑏)
11 simprl 531 . . . . . . . . . . . 12 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑎𝑏)
1210, 11nsyl3 631 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → ¬ 𝑏 = ∅)
13 elrabi 2959 . . . . . . . . . . . . . . . 16 (𝑏 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))} → 𝑏 ∈ {∅, {∅}})
14 reg3exmidlemwe.a . . . . . . . . . . . . . . . 16 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))}
1513, 14eleq2s 2326 . . . . . . . . . . . . . . 15 (𝑏𝐴𝑏 ∈ {∅, {∅}})
16 elpri 3692 . . . . . . . . . . . . . . 15 (𝑏 ∈ {∅, {∅}} → (𝑏 = ∅ ∨ 𝑏 = {∅}))
1715, 16syl 14 . . . . . . . . . . . . . 14 (𝑏𝐴 → (𝑏 = ∅ ∨ 𝑏 = {∅}))
1817orcomd 736 . . . . . . . . . . . . 13 (𝑏𝐴 → (𝑏 = {∅} ∨ 𝑏 = ∅))
19183ad2ant2 1045 . . . . . . . . . . . 12 ((𝑎𝐴𝑏𝐴𝑐𝐴) → (𝑏 = {∅} ∨ 𝑏 = ∅))
2019adantr 276 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → (𝑏 = {∅} ∨ 𝑏 = ∅))
2112, 20ecased 1385 . . . . . . . . . 10 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑏 = {∅})
22 noel 3498 . . . . . . . . . . . . 13 ¬ 𝑏 ∈ ∅
23 eleq2 2295 . . . . . . . . . . . . 13 (𝑐 = ∅ → (𝑏𝑐𝑏 ∈ ∅))
2422, 23mtbiri 681 . . . . . . . . . . . 12 (𝑐 = ∅ → ¬ 𝑏𝑐)
2524, 7nsyl3 631 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → ¬ 𝑐 = ∅)
26 elrabi 2959 . . . . . . . . . . . . . . . 16 (𝑐 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))} → 𝑐 ∈ {∅, {∅}})
2726, 14eleq2s 2326 . . . . . . . . . . . . . . 15 (𝑐𝐴𝑐 ∈ {∅, {∅}})
28 vex 2805 . . . . . . . . . . . . . . . 16 𝑐 ∈ V
2928elpr 3690 . . . . . . . . . . . . . . 15 (𝑐 ∈ {∅, {∅}} ↔ (𝑐 = ∅ ∨ 𝑐 = {∅}))
3027, 29sylib 122 . . . . . . . . . . . . . 14 (𝑐𝐴 → (𝑐 = ∅ ∨ 𝑐 = {∅}))
3130orcomd 736 . . . . . . . . . . . . 13 (𝑐𝐴 → (𝑐 = {∅} ∨ 𝑐 = ∅))
32313ad2ant3 1046 . . . . . . . . . . . 12 ((𝑎𝐴𝑏𝐴𝑐𝐴) → (𝑐 = {∅} ∨ 𝑐 = ∅))
3332adantr 276 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → (𝑐 = {∅} ∨ 𝑐 = ∅))
3425, 33ecased 1385 . . . . . . . . . 10 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑐 = {∅})
357, 21, 343eltr3d 2314 . . . . . . . . 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 2619 . 2 𝑎𝐴𝑏𝐴𝑐𝐴 ((𝑎 E 𝑏𝑏 E 𝑐) → 𝑎 E 𝑐)
43 df-wetr 4431 . 2 ( E We 𝐴 ↔ ( E Fr 𝐴 ∧ ∀𝑎𝐴𝑏𝐴𝑐𝐴 ((𝑎 E 𝑏𝑏 E 𝑐) → 𝑎 E 𝑐)))
441, 42, 43mpbir2an 950 1 E We 𝐴
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 715  w3a 1004   = wceq 1397  wcel 2202  wral 2510  {crab 2514  c0 3494  {csn 3669  {cpr 3670   class class class wbr 4088   E cep 4384   Fr wfr 4425   We wwe 4427
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rab 2519  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-eprel 4386  df-frfor 4428  df-frind 4429  df-wetr 4431
This theorem is referenced by:  reg3exmid  4678
  Copyright terms: Public domain W3C validator