Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-ismooredr2 Structured version   Visualization version   GIF version

Theorem bj-ismooredr2 37093
Description: Sufficient condition to be a Moore collection (variant of bj-ismooredr 37092 singling out the empty intersection). Note that there is no sethood hypothesis on 𝐴: it is a consequence of the first hypothesis. (Contributed by BJ, 9-Dec-2021.)
Hypotheses
Ref Expression
bj-ismooredr2.1 (𝜑 𝐴𝐴)
bj-ismooredr2.2 ((𝜑 ∧ (𝑥𝐴𝑥 ≠ ∅)) → 𝑥𝐴)
Assertion
Ref Expression
bj-ismooredr2 (𝜑𝐴Moore)
Distinct variable groups:   𝜑,𝑥   𝑥,𝐴

Proof of Theorem bj-ismooredr2
StepHypRef Expression
1 bj-ismooredr2.2 . . . . . 6 ((𝜑 ∧ (𝑥𝐴𝑥 ≠ ∅)) → 𝑥𝐴)
21anassrs 467 . . . . 5 (((𝜑𝑥𝐴) ∧ 𝑥 ≠ ∅) → 𝑥𝐴)
3 intssuni2 4978 . . . . . . 7 ((𝑥𝐴𝑥 ≠ ∅) → 𝑥 𝐴)
4 dfss 3982 . . . . . . . 8 ( 𝑥 𝐴 𝑥 = ( 𝑥 𝐴))
5 incom 4217 . . . . . . . . . . 11 ( 𝑥 𝐴) = ( 𝐴 𝑥)
65eqeq2i 2748 . . . . . . . . . 10 ( 𝑥 = ( 𝑥 𝐴) ↔ 𝑥 = ( 𝐴 𝑥))
7 eleq1 2827 . . . . . . . . . 10 ( 𝑥 = ( 𝐴 𝑥) → ( 𝑥𝐴 ↔ ( 𝐴 𝑥) ∈ 𝐴))
86, 7sylbi 217 . . . . . . . . 9 ( 𝑥 = ( 𝑥 𝐴) → ( 𝑥𝐴 ↔ ( 𝐴 𝑥) ∈ 𝐴))
98biimpd 229 . . . . . . . 8 ( 𝑥 = ( 𝑥 𝐴) → ( 𝑥𝐴 → ( 𝐴 𝑥) ∈ 𝐴))
104, 9sylbi 217 . . . . . . 7 ( 𝑥 𝐴 → ( 𝑥𝐴 → ( 𝐴 𝑥) ∈ 𝐴))
113, 10syl 17 . . . . . 6 ((𝑥𝐴𝑥 ≠ ∅) → ( 𝑥𝐴 → ( 𝐴 𝑥) ∈ 𝐴))
1211adantll 714 . . . . 5 (((𝜑𝑥𝐴) ∧ 𝑥 ≠ ∅) → ( 𝑥𝐴 → ( 𝐴 𝑥) ∈ 𝐴))
132, 12mpd 15 . . . 4 (((𝜑𝑥𝐴) ∧ 𝑥 ≠ ∅) → ( 𝐴 𝑥) ∈ 𝐴)
1413ex 412 . . 3 ((𝜑𝑥𝐴) → (𝑥 ≠ ∅ → ( 𝐴 𝑥) ∈ 𝐴))
15 nne 2942 . . . . 5 𝑥 ≠ ∅ ↔ 𝑥 = ∅)
16 bj-ismooredr2.1 . . . . . 6 (𝜑 𝐴𝐴)
17 rint0 4993 . . . . . 6 (𝑥 = ∅ → ( 𝐴 𝑥) = 𝐴)
18 eleq1a 2834 . . . . . 6 ( 𝐴𝐴 → (( 𝐴 𝑥) = 𝐴 → ( 𝐴 𝑥) ∈ 𝐴))
1916, 17, 18syl2im 40 . . . . 5 (𝜑 → (𝑥 = ∅ → ( 𝐴 𝑥) ∈ 𝐴))
2015, 19biimtrid 242 . . . 4 (𝜑 → (¬ 𝑥 ≠ ∅ → ( 𝐴 𝑥) ∈ 𝐴))
2120adantr 480 . . 3 ((𝜑𝑥𝐴) → (¬ 𝑥 ≠ ∅ → ( 𝐴 𝑥) ∈ 𝐴))
2214, 21pm2.61d 179 . 2 ((𝜑𝑥𝐴) → ( 𝐴 𝑥) ∈ 𝐴)
2322bj-ismooredr 37092 1 (𝜑𝐴Moore)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  wne 2938  cin 3962  wss 3963  c0 4339   cuni 4912   cint 4951  Moorecmoore 37086
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371
This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-in 3970  df-ss 3980  df-nul 4340  df-pw 4607  df-uni 4913  df-int 4952  df-bj-moore 37087
This theorem is referenced by:  bj-snmoore  37096  bj-prmoore  37098
  Copyright terms: Public domain W3C validator