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

Theorem wfii 6175
Description: The Principle of Well-Founded Induction. Theorem 6.27 of [TakeutiZaring] p. 32. This principle states that if 𝐵 is a subclass of a well-ordered class 𝐴 with the property that every element of 𝐵 whose inital segment is included in 𝐴 is itself equal to 𝐴. (Contributed by Scott Fenton, 29-Jan-2011.) (Revised by Mario Carneiro, 26-Jun-2015.)
Hypotheses
Ref Expression
wfi.1 𝑅 We 𝐴
wfi.2 𝑅 Se 𝐴
Assertion
Ref Expression
wfii ((𝐵𝐴 ∧ ∀𝑦𝐴 (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵𝑦𝐵)) → 𝐴 = 𝐵)
Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑦,𝑅

Proof of Theorem wfii
StepHypRef Expression
1 wfi.1 . 2 𝑅 We 𝐴
2 wfi.2 . 2 𝑅 Se 𝐴
3 wfi 6174 . 2 (((𝑅 We 𝐴𝑅 Se 𝐴) ∧ (𝐵𝐴 ∧ ∀𝑦𝐴 (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵𝑦𝐵))) → 𝐴 = 𝐵)
41, 2, 3mpanl12 698 1 ((𝐵𝐴 ∧ ∀𝑦𝐴 (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵𝑦𝐵)) → 𝐴 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1528  wcel 2105  wral 3135  wss 3933   Se wse 5505   We wwe 5506  Predcpred 6140
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pr 5320
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-reu 3142  df-rmo 3143  df-rab 3144  df-v 3494  df-sbc 3770  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564  df-br 5058  df-opab 5120  df-po 5467  df-so 5468  df-fr 5507  df-se 5508  df-we 5509  df-xp 5554  df-cnv 5556  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator