Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj529 Structured version   Visualization version   GIF version

Theorem bnj529 34734
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj529.1 𝐷 = (ω ∖ {∅})
Assertion
Ref Expression
bnj529 (𝑀𝐷 → ∅ ∈ 𝑀)

Proof of Theorem bnj529
StepHypRef Expression
1 eldifsn 4791 . . . 4 (𝑀 ∈ (ω ∖ {∅}) ↔ (𝑀 ∈ ω ∧ 𝑀 ≠ ∅))
21biimpi 216 . . 3 (𝑀 ∈ (ω ∖ {∅}) → (𝑀 ∈ ω ∧ 𝑀 ≠ ∅))
3 bnj529.1 . . 3 𝐷 = (ω ∖ {∅})
42, 3eleq2s 2857 . 2 (𝑀𝐷 → (𝑀 ∈ ω ∧ 𝑀 ≠ ∅))
5 nnord 7895 . . 3 (𝑀 ∈ ω → Ord 𝑀)
65anim1i 615 . 2 ((𝑀 ∈ ω ∧ 𝑀 ≠ ∅) → (Ord 𝑀𝑀 ≠ ∅))
7 ord0eln0 6441 . . 3 (Ord 𝑀 → (∅ ∈ 𝑀𝑀 ≠ ∅))
87biimpar 477 . 2 ((Ord 𝑀𝑀 ≠ ∅) → ∅ ∈ 𝑀)
94, 6, 83syl 18 1 (𝑀𝐷 → ∅ ∈ 𝑀)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  wne 2938  cdif 3960  c0 4339  {csn 4631  Ord word 6385  ωcom 7887
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-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  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-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-tr 5266  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-ord 6389  df-on 6390  df-om 7888
This theorem is referenced by:  bnj545  34888  bnj900  34922  bnj929  34929
  Copyright terms: Public domain W3C validator