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

Theorem reg3exmidlemwe 4721
Description: Lemma for reg3exmid 4722. 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 4716 . 2 E Fr 𝐴
2 epel 4432 . . . . . 6 (𝑎 E 𝑏𝑎𝑏)
3 epel 4432 . . . . . 6 (𝑏 E 𝑐𝑏𝑐)
42, 3anbi12i 464 . . . . 5 ((𝑎 E 𝑏𝑏 E 𝑐) ↔ (𝑎𝑏𝑏𝑐))
5 simpr 110 . . . . . 6 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → (𝑎𝑏𝑏𝑐))
6 elirr 4683 . . . . . . . 8 ¬ {∅} ∈ {∅}
7 simprr 537 . . . . . . . . . 10 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑏𝑐)
8 noel 3525 . . . . . . . . . . . . 13 ¬ 𝑎 ∈ ∅
9 eleq2 2302 . . . . . . . . . . . . 13 (𝑏 = ∅ → (𝑎𝑏𝑎 ∈ ∅))
108, 9mtbiri 686 . . . . . . . . . . . 12 (𝑏 = ∅ → ¬ 𝑎𝑏)
11 simprl 535 . . . . . . . . . . . 12 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑎𝑏)
1210, 11nsyl3 635 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → ¬ 𝑏 = ∅)
13 elrabi 2979 . . . . . . . . . . . . . . . 16 (𝑏 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))} → 𝑏 ∈ {∅, {∅}})
14 reg3exmidlemwe.a . . . . . . . . . . . . . . . 16 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))}
1513, 14eleq2s 2333 . . . . . . . . . . . . . . 15 (𝑏𝐴𝑏 ∈ {∅, {∅}})
16 elpri 3728 . . . . . . . . . . . . . . 15 (𝑏 ∈ {∅, {∅}} → (𝑏 = ∅ ∨ 𝑏 = {∅}))
1715, 16syl 14 . . . . . . . . . . . . . 14 (𝑏𝐴 → (𝑏 = ∅ ∨ 𝑏 = {∅}))
1817orcomd 741 . . . . . . . . . . . . 13 (𝑏𝐴 → (𝑏 = {∅} ∨ 𝑏 = ∅))
19183ad2ant2 1050 . . . . . . . . . . . 12 ((𝑎𝐴𝑏𝐴𝑐𝐴) → (𝑏 = {∅} ∨ 𝑏 = ∅))
2019adantr 276 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → (𝑏 = {∅} ∨ 𝑏 = ∅))
2112, 20ecased 1390 . . . . . . . . . 10 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑏 = {∅})
22 noel 3525 . . . . . . . . . . . . 13 ¬ 𝑏 ∈ ∅
23 eleq2 2302 . . . . . . . . . . . . 13 (𝑐 = ∅ → (𝑏𝑐𝑏 ∈ ∅))
2422, 23mtbiri 686 . . . . . . . . . . . 12 (𝑐 = ∅ → ¬ 𝑏𝑐)
2524, 7nsyl3 635 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → ¬ 𝑐 = ∅)
26 elrabi 2979 . . . . . . . . . . . . . . . 16 (𝑐 ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ (𝑥 = ∅ ∧ 𝜑))} → 𝑐 ∈ {∅, {∅}})
2726, 14eleq2s 2333 . . . . . . . . . . . . . . 15 (𝑐𝐴𝑐 ∈ {∅, {∅}})
28 vex 2824 . . . . . . . . . . . . . . . 16 𝑐 ∈ V
2928elpr 3726 . . . . . . . . . . . . . . 15 (𝑐 ∈ {∅, {∅}} ↔ (𝑐 = ∅ ∨ 𝑐 = {∅}))
3027, 29sylib 122 . . . . . . . . . . . . . 14 (𝑐𝐴 → (𝑐 = ∅ ∨ 𝑐 = {∅}))
3130orcomd 741 . . . . . . . . . . . . 13 (𝑐𝐴 → (𝑐 = {∅} ∨ 𝑐 = ∅))
32313ad2ant3 1051 . . . . . . . . . . . 12 ((𝑎𝐴𝑏𝐴𝑐𝐴) → (𝑐 = {∅} ∨ 𝑐 = ∅))
3332adantr 276 . . . . . . . . . . 11 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → (𝑐 = {∅} ∨ 𝑐 = ∅))
3425, 33ecased 1390 . . . . . . . . . 10 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑐 = {∅})
357, 21, 343eltr3d 2321 . . . . . . . . 9 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → {∅} ∈ {∅})
3635ex 115 . . . . . . . 8 ((𝑎𝐴𝑏𝐴𝑐𝐴) → ((𝑎𝑏𝑏𝑐) → {∅} ∈ {∅}))
376, 36mtoi 674 . . . . . . 7 ((𝑎𝐴𝑏𝐴𝑐𝐴) → ¬ (𝑎𝑏𝑏𝑐))
3837adantr 276 . . . . . 6 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → ¬ (𝑎𝑏𝑏𝑐))
395, 38pm2.21dd 629 . . . . 5 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎𝑏𝑏𝑐)) → 𝑎 E 𝑐)
404, 39sylan2b 287 . . . 4 (((𝑎𝐴𝑏𝐴𝑐𝐴) ∧ (𝑎 E 𝑏𝑏 E 𝑐)) → 𝑎 E 𝑐)
4140ex 115 . . 3 ((𝑎𝐴𝑏𝐴𝑐𝐴) → ((𝑎 E 𝑏𝑏 E 𝑐) → 𝑎 E 𝑐))
4241rgen3 2637 . 2 𝑎𝐴𝑏𝐴𝑐𝐴 ((𝑎 E 𝑏𝑏 E 𝑐) → 𝑎 E 𝑐)
43 df-wetr 4474 . 2 ( E We 𝐴 ↔ ( E Fr 𝐴 ∧ ∀𝑎𝐴𝑏𝐴𝑐𝐴 ((𝑎 E 𝑏𝑏 E 𝑐) → 𝑎 E 𝑐)))
441, 42, 43mpbir2an 955 1 E We 𝐴
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 720  w3a 1009   = wceq 1402  wcel 2209  wral 2528  {crab 2532  c0 3520  {csn 3705  {cpr 3706   class class class wbr 4125   E cep 4427   Fr wfr 4468   We wwe 4470
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 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 4244  ax-pow 4306  ax-pr 4341  ax-setind 4679
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-eprel 4429  df-frfor 4471  df-frind 4472  df-wetr 4474
This theorem is referenced by:  reg3exmid  4722
  Copyright terms: Public domain W3C validator