Theorem wfis 6243

Description: Well-Ordered Induction Schema. If all elements less than a given set 𝑥 of the well-ordered class 𝐴 have a property (induction hypothesis), then all elements of 𝐴 have that property. (Contributed by Scott Fenton, 29-Jan-2011.)

Hypotheses

Ref	Expression
wfis.1	⊢ 𝑅 We 𝐴
wfis.2	⊢ 𝑅 Se 𝐴
wfis.3	⊢ (𝑦 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑))

Assertion

Ref	Expression
wfis	⊢ (𝑦 ∈ 𝐴 → 𝜑)

Distinct variable groups:   𝑦,𝐴,𝑧   𝜑,𝑧   𝑦,𝑅,𝑧

Allowed substitution hint:   𝜑(𝑦)

Proof of Theorem wfis

Step	Hyp	Ref	Expression
1		wfis.1	. . 3 ⊢ 𝑅 We 𝐴
2		wfis.2	. . 3 ⊢ 𝑅 Se 𝐴
3		wfis.3	. . . 4 ⊢ (𝑦 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑))
4	3	wfisg 6241	. . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑)
5	1, 2, 4	mp2an 688	. 2 ⊢ ∀𝑦 ∈ 𝐴 𝜑
6	5	rspec 3131	1 ⊢ (𝑦 ∈ 𝐴 → 𝜑)

Syntax hints:   → wi 4   ∈ wcel 2108  ∀wral 3063  [wsbc 3711   Se wse 5533   We wwe 5534  Predcpred 6190

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-po 5494  df-so 5495  df-fr 5535  df-se 5536  df-we 5537  df-xp 5586  df-cnv 5588  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191

This theorem is referenced by: (None)