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

Theorem wfisg 6161
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 4031 . . 3 {𝑦𝐴𝜑} ⊆ 𝐴
2 dfss3 3930 . . . . . . . 8 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦𝐴𝜑})
3 nfcv 2979 . . . . . . . . . . 11 𝑦𝐴
43elrabsf 3791 . . . . . . . . . 10 (𝑧 ∈ {𝑦𝐴𝜑} ↔ (𝑧𝐴[𝑧 / 𝑦]𝜑))
54simprbi 500 . . . . . . . . 9 (𝑧 ∈ {𝑦𝐴𝜑} → [𝑧 / 𝑦]𝜑)
65ralimi 3152 . . . . . . . 8 (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦𝐴𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
72, 6sylbi 220 . . . . . . 7 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
8 nfv 1915 . . . . . . . . 9 𝑦 𝑤𝐴
9 nfcv 2979 . . . . . . . . . . 11 𝑦Pred(𝑅, 𝐴, 𝑤)
10 nfsbc1v 3767 . . . . . . . . . . 11 𝑦[𝑧 / 𝑦]𝜑
119, 10nfralw 3214 . . . . . . . . . 10 𝑦𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑
12 nfsbc1v 3767 . . . . . . . . . 10 𝑦[𝑤 / 𝑦]𝜑
1311, 12nfim 1897 . . . . . . . . 9 𝑦(∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑)
148, 13nfim 1897 . . . . . . . 8 𝑦(𝑤𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑))
15 eleq1w 2896 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑦𝐴𝑤𝐴))
16 predeq3 6130 . . . . . . . . . . 11 (𝑦 = 𝑤 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑤))
1716raleqdv 3392 . . . . . . . . . 10 (𝑦 = 𝑤 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑))
18 sbceq1a 3758 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝜑[𝑤 / 𝑦]𝜑))
1917, 18imbi12d 348 . . . . . . . . 9 (𝑦 = 𝑤 → ((∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑) ↔ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑)))
2015, 19imbi12d 348 . . . . . . . 8 (𝑦 = 𝑤 → ((𝑦𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑)) ↔ (𝑤𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑))))
21 wfisg.1 . . . . . . . 8 (𝑦𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑𝜑))
2214, 20, 21chvarfv 2243 . . . . . . 7 (𝑤𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑[𝑤 / 𝑦]𝜑))
237, 22syl5 34 . . . . . 6 (𝑤𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → [𝑤 / 𝑦]𝜑))
2423anc2li 559 . . . . 5 (𝑤𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → (𝑤𝐴[𝑤 / 𝑦]𝜑)))
253elrabsf 3791 . . . . 5 (𝑤 ∈ {𝑦𝐴𝜑} ↔ (𝑤𝐴[𝑤 / 𝑦]𝜑))
2624, 25syl6ibr 255 . . . 4 (𝑤𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → 𝑤 ∈ {𝑦𝐴𝜑}))
2726rgen 3140 . . 3 𝑤𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → 𝑤 ∈ {𝑦𝐴𝜑})
28 wfi 6159 . . 3 (((𝑅 We 𝐴𝑅 Se 𝐴) ∧ ({𝑦𝐴𝜑} ⊆ 𝐴 ∧ ∀𝑤𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦𝐴𝜑} → 𝑤 ∈ {𝑦𝐴𝜑}))) → 𝐴 = {𝑦𝐴𝜑})
291, 27, 28mpanr12 704 . 2 ((𝑅 We 𝐴𝑅 Se 𝐴) → 𝐴 = {𝑦𝐴𝜑})
30 rabid2 3362 . 2 (𝐴 = {𝑦𝐴𝜑} ↔ ∀𝑦𝐴 𝜑)
3129, 30sylib 221 1 ((𝑅 We 𝐴𝑅 Se 𝐴) → ∀𝑦𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2114  wral 3130  {crab 3134  [wsbc 3747  wss 3908   Se wse 5489   We wwe 5490  Predcpred 6125
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pr 5307
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-ral 3135  df-rex 3136  df-reu 3137  df-rmo 3138  df-rab 3139  df-v 3471  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-sn 4540  df-pr 4542  df-op 4546  df-br 5043  df-opab 5105  df-po 5451  df-so 5452  df-fr 5491  df-se 5492  df-we 5493  df-xp 5538  df-cnv 5540  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-pred 6126
This theorem is referenced by:  wfis  6162  wfis2fg  6163
  Copyright terms: Public domain W3C validator