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

Theorem wfisg 5632
 Description: Well-Founded Induction Schema. If a property passes from all elements less than 𝑦 of a well-founded class 𝐴 to 𝑦 itself (induction hypothesis), then the property holds for all elements of 𝐴. (Contributed by Scott Fenton, 11-Feb-2011.)
Hypothesis
Ref Expression
wfisg.1 (𝑦𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑))
Assertion
Ref Expression
wfisg ((𝑅 We 𝐴𝑅 Se 𝐴) → ∀𝑦𝐴 𝜑)
Distinct variable groups:   𝑦,𝐴,𝑧   𝜑,𝑧   𝑦,𝑅,𝑧
Allowed substitution hint:   𝜑(𝑦)

Proof of Theorem wfisg
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 ssrab2 3650 . . 3 {𝑦𝐴𝜑} ⊆ 𝐴
2 dfss3 3558 . . . . . . . 8 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦𝐴𝜑})
3 nfcv 2751 . . . . . . . . . . 11 𝑦𝐴
43elrabsf 3441 . . . . . . . . . 10 (𝑧 ∈ {𝑦𝐴𝜑} ↔ (𝑧𝐴[𝑧 / 𝑦]𝜑))
54simprbi 479 . . . . . . . . 9 (𝑧 ∈ {𝑦𝐴𝜑} → [𝑧 / 𝑦]𝜑)
65ralimi 2936 . . . . . . . 8 (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦𝐴𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
72, 6sylbi 206 . . . . . . 7 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
8 nfv 1830 . . . . . . . . 9 𝑦 𝑤𝐴
9 nfcv 2751 . . . . . . . . . . 11 𝑦Pred(𝑅, 𝐴, 𝑤)
10 nfsbc1v 3422 . . . . . . . . . . 11 𝑦[𝑧 / 𝑦]𝜑
119, 10nfral 2929 . . . . . . . . . 10 𝑦𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑
12 nfsbc1v 3422 . . . . . . . . . 10 𝑦[𝑤 / 𝑦]𝜑
1311, 12nfim 1813 . . . . . . . . 9 𝑦(∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑)
148, 13nfim 1813 . . . . . . . 8 𝑦(𝑤𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑))
15 eleq1 2676 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑦𝐴𝑤𝐴))
16 predeq3 5601 . . . . . . . . . . 11 (𝑦 = 𝑤 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑤))
1716raleqdv 3121 . . . . . . . . . 10 (𝑦 = 𝑤 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑))
18 sbceq1a 3413 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝜑[𝑤 / 𝑦]𝜑))
1917, 18imbi12d 333 . . . . . . . . 9 (𝑦 = 𝑤 → ((∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑) ↔ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑)))
2015, 19imbi12d 333 . . . . . . . 8 (𝑦 = 𝑤 → ((𝑦𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑)) ↔ (𝑤𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑))))
21 wfisg.1 . . . . . . . 8 (𝑦𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑))
2214, 20, 21chvar 2250 . . . . . . 7 (𝑤𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑))
237, 22syl5 33 . . . . . 6 (𝑤𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → [𝑤 / 𝑦]𝜑))
2423anc2li 578 . . . . 5 (𝑤𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → (𝑤𝐴[𝑤 / 𝑦]𝜑)))
253elrabsf 3441 . . . . 5 (𝑤 ∈ {𝑦𝐴𝜑} ↔ (𝑤𝐴[𝑤 / 𝑦]𝜑))
2624, 25syl6ibr 241 . . . 4 (𝑤𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → 𝑤 ∈ {𝑦𝐴𝜑}))
2726rgen 2906 . . 3 𝑤𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → 𝑤 ∈ {𝑦𝐴𝜑})
28 wfi 5630 . . 3 (((𝑅 We 𝐴𝑅 Se 𝐴) ∧ ({𝑦𝐴𝜑} ⊆ 𝐴 ∧ ∀𝑤𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → 𝑤 ∈ {𝑦𝐴𝜑}))) → 𝐴 = {𝑦𝐴𝜑})
291, 27, 28mpanr12 717 . 2 ((𝑅 We 𝐴𝑅 Se 𝐴) → 𝐴 = {𝑦𝐴𝜑})
30 rabid2 3096 . 2 (𝐴 = {𝑦𝐴𝜑} ↔ ∀𝑦𝐴 𝜑)
3129, 30sylib 207 1 ((𝑅 We 𝐴𝑅 Se 𝐴) → ∀𝑦𝐴 𝜑)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  {crab 2900  [wsbc 3402   ⊆ wss 3540   Se wse 4995   We wwe 4996  Predcpred 5596 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-cnv 5046  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597 This theorem is referenced by:  wfis  5633  wfis2fg  5634
 Copyright terms: Public domain W3C validator