MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tz6.26 Structured version   Visualization version   GIF version

Theorem tz6.26 5872
Description: All nonempty (possibly proper) subclasses of 𝐴, which has a well-founded relation 𝑅, have 𝑅-minimal elements. Proposition 6.26 of [TakeutiZaring] p. 31. (Contributed by Scott Fenton, 29-Jan-2011.) (Revised by Mario Carneiro, 26-Jun-2015.)
Assertion
Ref Expression
tz6.26 (((𝑅 We 𝐴𝑅 Se 𝐴) ∧ (𝐵𝐴𝐵 ≠ ∅)) → ∃𝑦𝐵 Pred(𝑅, 𝐵, 𝑦) = ∅)
Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑦,𝑅

Proof of Theorem tz6.26
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 wereu2 5263 . . 3 (((𝑅 We 𝐴𝑅 Se 𝐴) ∧ (𝐵𝐴𝐵 ≠ ∅)) → ∃!𝑦𝐵𝑥𝐵 ¬ 𝑥𝑅𝑦)
2 reurex 3299 . . 3 (∃!𝑦𝐵𝑥𝐵 ¬ 𝑥𝑅𝑦 → ∃𝑦𝐵𝑥𝐵 ¬ 𝑥𝑅𝑦)
31, 2syl 17 . 2 (((𝑅 We 𝐴𝑅 Se 𝐴) ∧ (𝐵𝐴𝐵 ≠ ∅)) → ∃𝑦𝐵𝑥𝐵 ¬ 𝑥𝑅𝑦)
4 rabeq0 4100 . . . 4 ({𝑥𝐵𝑥𝑅𝑦} = ∅ ↔ ∀𝑥𝐵 ¬ 𝑥𝑅𝑦)
5 dfrab3 4045 . . . . . 6 {𝑥𝐵𝑥𝑅𝑦} = (𝐵 ∩ {𝑥𝑥𝑅𝑦})
6 vex 3343 . . . . . . 7 𝑦 ∈ V
76dfpred2 5850 . . . . . 6 Pred(𝑅, 𝐵, 𝑦) = (𝐵 ∩ {𝑥𝑥𝑅𝑦})
85, 7eqtr4i 2785 . . . . 5 {𝑥𝐵𝑥𝑅𝑦} = Pred(𝑅, 𝐵, 𝑦)
98eqeq1i 2765 . . . 4 ({𝑥𝐵𝑥𝑅𝑦} = ∅ ↔ Pred(𝑅, 𝐵, 𝑦) = ∅)
104, 9bitr3i 266 . . 3 (∀𝑥𝐵 ¬ 𝑥𝑅𝑦 ↔ Pred(𝑅, 𝐵, 𝑦) = ∅)
1110rexbii 3179 . 2 (∃𝑦𝐵𝑥𝐵 ¬ 𝑥𝑅𝑦 ↔ ∃𝑦𝐵 Pred(𝑅, 𝐵, 𝑦) = ∅)
123, 11sylib 208 1 (((𝑅 We 𝐴𝑅 Se 𝐴) ∧ (𝐵𝐴𝐵 ≠ ∅)) → ∃𝑦𝐵 Pred(𝑅, 𝐵, 𝑦) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383   = wceq 1632  {cab 2746  wne 2932  wral 3050  wrex 3051  ∃!wreu 3052  {crab 3054  cin 3714  wss 3715  c0 4058   class class class wbr 4804   Se wse 5223   We wwe 5224  Predcpred 5840
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-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pr 5055
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  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-rmo 3058  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-sn 4322  df-pr 4324  df-op 4328  df-br 4805  df-opab 4865  df-po 5187  df-so 5188  df-fr 5225  df-se 5226  df-we 5227  df-xp 5272  df-cnv 5274  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841
This theorem is referenced by:  tz6.26i  5873  wfi  5874  wzel  32075  wsuclem  32076
  Copyright terms: Public domain W3C validator