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

Theorem wfii 5673
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 5672 . 2 (((𝑅 We 𝐴𝑅 Se 𝐴) ∧ (𝐵𝐴 ∧ ∀𝑦𝐴 (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵𝑦𝐵))) → 𝐴 = 𝐵)
41, 2, 3mpanl12 717 1 ((𝐵𝐴 ∧ ∀𝑦𝐴 (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵𝑦𝐵)) → 𝐴 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1480  wcel 1987  wral 2907  wss 3555   Se wse 5031   We wwe 5032  Predcpred 5638
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3188  df-sbc 3418  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-br 4614  df-opab 4674  df-po 4995  df-so 4996  df-fr 5033  df-se 5034  df-we 5035  df-xp 5080  df-cnv 5082  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator