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

Theorem wfisg 6186
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 4059 . . 3 {𝑦𝐴𝜑} ⊆ 𝐴
2 dfss3 3959 . . . . . . . 8 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦𝐴𝜑})
3 nfcv 2980 . . . . . . . . . . 11 𝑦𝐴
43elrabsf 3819 . . . . . . . . . 10 (𝑧 ∈ {𝑦𝐴𝜑} ↔ (𝑧𝐴[𝑧 / 𝑦]𝜑))
54simprbi 499 . . . . . . . . 9 (𝑧 ∈ {𝑦𝐴𝜑} → [𝑧 / 𝑦]𝜑)
65ralimi 3163 . . . . . . . 8 (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦𝐴𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
72, 6sylbi 219 . . . . . . 7 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
8 nfv 1914 . . . . . . . . 9 𝑦 𝑤𝐴
9 nfcv 2980 . . . . . . . . . . 11 𝑦Pred(𝑅, 𝐴, 𝑤)
10 nfsbc1v 3795 . . . . . . . . . . 11 𝑦[𝑧 / 𝑦]𝜑
119, 10nfralw 3228 . . . . . . . . . 10 𝑦𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑
12 nfsbc1v 3795 . . . . . . . . . 10 𝑦[𝑤 / 𝑦]𝜑
1311, 12nfim 1896 . . . . . . . . 9 𝑦(∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑)
148, 13nfim 1896 . . . . . . . 8 𝑦(𝑤𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑))
15 eleq1w 2898 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑦𝐴𝑤𝐴))
16 predeq3 6155 . . . . . . . . . . 11 (𝑦 = 𝑤 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑤))
1716raleqdv 3418 . . . . . . . . . 10 (𝑦 = 𝑤 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑))
18 sbceq1a 3786 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝜑[𝑤 / 𝑦]𝜑))
1917, 18imbi12d 347 . . . . . . . . 9 (𝑦 = 𝑤 → ((∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑) ↔ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑)))
2015, 19imbi12d 347 . . . . . . . 8 (𝑦 = 𝑤 → ((𝑦𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑)) ↔ (𝑤𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑))))
21 wfisg.1 . . . . . . . 8 (𝑦𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑))
2214, 20, 21chvarfv 2241 . . . . . . 7 (𝑤𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑))
237, 22syl5 34 . . . . . 6 (𝑤𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → [𝑤 / 𝑦]𝜑))
2423anc2li 558 . . . . 5 (𝑤𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → (𝑤𝐴[𝑤 / 𝑦]𝜑)))
253elrabsf 3819 . . . . 5 (𝑤 ∈ {𝑦𝐴𝜑} ↔ (𝑤𝐴[𝑤 / 𝑦]𝜑))
2624, 25syl6ibr 254 . . . 4 (𝑤𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → 𝑤 ∈ {𝑦𝐴𝜑}))
2726rgen 3151 . . 3 𝑤𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → 𝑤 ∈ {𝑦𝐴𝜑})
28 wfi 6184 . . 3 (((𝑅 We 𝐴𝑅 Se 𝐴) ∧ ({𝑦𝐴𝜑} ⊆ 𝐴 ∧ ∀𝑤𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → 𝑤 ∈ {𝑦𝐴𝜑}))) → 𝐴 = {𝑦𝐴𝜑})
291, 27, 28mpanr12 703 . 2 ((𝑅 We 𝐴𝑅 Se 𝐴) → 𝐴 = {𝑦𝐴𝜑})
30 rabid2 3384 . 2 (𝐴 = {𝑦𝐴𝜑} ↔ ∀𝑦𝐴 𝜑)
3129, 30sylib 220 1 ((𝑅 We 𝐴𝑅 Se 𝐴) → ∀𝑦𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1536  wcel 2113  wral 3141  {crab 3145  [wsbc 3775  wss 3939   Se wse 5515   We wwe 5516  Predcpred 6150
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rmo 3149  df-rab 3150  df-v 3499  df-sbc 3776  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-br 5070  df-opab 5132  df-po 5477  df-so 5478  df-fr 5517  df-se 5518  df-we 5519  df-xp 5564  df-cnv 5566  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151
This theorem is referenced by:  wfis  6187  wfis2fg  6188
  Copyright terms: Public domain W3C validator