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

Theorem bnj1228 31386
Description: Existence of a minimal element in certain classes: if 𝑅 is well-founded and set-like on 𝐴, then every nonempty subclass of 𝐴 has a minimal element. The proof has been taken from Chapter 4 of Don Monk's notes on Set Theory. See http://euclid.colorado.edu/~monkd/setth.pdf. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj1228.1 (𝑤𝐵 → ∀𝑥 𝑤𝐵)
Assertion
Ref Expression
bnj1228 ((𝑅 FrSe 𝐴𝐵𝐴𝐵 ≠ ∅) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
Distinct variable groups:   𝑦,𝐴   𝑤,𝐵,𝑦   𝑥,𝑅,𝑦   𝑥,𝑤
Allowed substitution hints:   𝐴(𝑥,𝑤)   𝐵(𝑥)   𝑅(𝑤)

Proof of Theorem bnj1228
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 bnj69 31385 . 2 ((𝑅 FrSe 𝐴𝐵𝐴𝐵 ≠ ∅) → ∃𝑧𝐵𝑦𝐵 ¬ 𝑦𝑅𝑧)
2 nfv 1992 . . . 4 𝑧(𝑥𝐵 ∧ ∀𝑦𝐵 ¬ 𝑦𝑅𝑥)
3 bnj1228.1 . . . . . . 7 (𝑤𝐵 → ∀𝑥 𝑤𝐵)
43nfcii 2893 . . . . . 6 𝑥𝐵
54nfcri 2896 . . . . 5 𝑥 𝑧𝐵
6 nfv 1992 . . . . . 6 𝑥 ¬ 𝑦𝑅𝑧
74, 6nfral 3083 . . . . 5 𝑥𝑦𝐵 ¬ 𝑦𝑅𝑧
85, 7nfan 1977 . . . 4 𝑥(𝑧𝐵 ∧ ∀𝑦𝐵 ¬ 𝑦𝑅𝑧)
9 eleq1w 2822 . . . . 5 (𝑥 = 𝑧 → (𝑥𝐵𝑧𝐵))
10 breq2 4808 . . . . . . 7 (𝑥 = 𝑧 → (𝑦𝑅𝑥𝑦𝑅𝑧))
1110notbid 307 . . . . . 6 (𝑥 = 𝑧 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝑧))
1211ralbidv 3124 . . . . 5 (𝑥 = 𝑧 → (∀𝑦𝐵 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦𝐵 ¬ 𝑦𝑅𝑧))
139, 12anbi12d 749 . . . 4 (𝑥 = 𝑧 → ((𝑥𝐵 ∧ ∀𝑦𝐵 ¬ 𝑦𝑅𝑥) ↔ (𝑧𝐵 ∧ ∀𝑦𝐵 ¬ 𝑦𝑅𝑧)))
142, 8, 13cbvex 2417 . . 3 (∃𝑥(𝑥𝐵 ∧ ∀𝑦𝐵 ¬ 𝑦𝑅𝑥) ↔ ∃𝑧(𝑧𝐵 ∧ ∀𝑦𝐵 ¬ 𝑦𝑅𝑧))
15 df-rex 3056 . . 3 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥(𝑥𝐵 ∧ ∀𝑦𝐵 ¬ 𝑦𝑅𝑥))
16 df-rex 3056 . . 3 (∃𝑧𝐵𝑦𝐵 ¬ 𝑦𝑅𝑧 ↔ ∃𝑧(𝑧𝐵 ∧ ∀𝑦𝐵 ¬ 𝑦𝑅𝑧))
1714, 15, 163bitr4i 292 . 2 (∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥 ↔ ∃𝑧𝐵𝑦𝐵 ¬ 𝑦𝑅𝑧)
181, 17sylibr 224 1 ((𝑅 FrSe 𝐴𝐵𝐴𝐵 ≠ ∅) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  w3a 1072  wal 1630  wex 1853  wcel 2139  wne 2932  wral 3050  wrex 3051  wss 3715  c0 4058   class class class wbr 4804   FrSe w-bnj15 31067
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114  ax-reg 8662  ax-inf2 8711
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-fal 1638  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-om 7231  df-1o 7729  df-bnj17 31062  df-bnj14 31064  df-bnj13 31066  df-bnj15 31068  df-bnj18 31070  df-bnj19 31072
This theorem is referenced by:  bnj1204  31387  bnj1311  31399  bnj1312  31433
  Copyright terms: Public domain W3C validator