Theorem frinsg 9779

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 𝐴. Theorem 5.6(ii) of [Levy] p. 64. (Contributed by Scott Fenton, 7-Feb-2011.) (Revised by Mario Carneiro, 26-Jun-2015.)

Hypothesis

Ref	Expression
frinsg.1	⊢ (𝑦 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑))

Assertion

Ref	Expression
frinsg	⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑)

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

Allowed substitution hint:   𝜑(𝑦)

Proof of Theorem frinsg

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 4008	. . 3 ⊢ {𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴
2		dfss3 3902	. . . . . . . 8 ⊢ (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑})
3		nfcv 2926	. . . . . . . . . . 11 ⊢ Ⅎ𝑦𝐴
4	3	elrabsf 3787	. . . . . . . . . 10 ⊢ (𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜑))
5	4	simprbi 503	. . . . . . . . 9 ⊢ (𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} → [𝑧 / 𝑦]𝜑)
6	5	ralimi 3103	. . . . . . . 8 ⊢ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
7	2, 6	sylbi 220	. . . . . . 7 ⊢ (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
8		nfv 1949	. . . . . . . . 9 ⊢ Ⅎ𝑦 𝑤 ∈ 𝐴
9		nfcv 2926	. . . . . . . . . . 11 ⊢ Ⅎ𝑦Pred(𝑅, 𝐴, 𝑤)
10		nfsbc1v 3762	. . . . . . . . . . 11 ⊢ Ⅎ𝑦[𝑧 / 𝑦]𝜑
11	9, 10	nfralw 3313	. . . . . . . . . 10 ⊢ Ⅎ𝑦∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑
12		nfsbc1v 3762	. . . . . . . . . 10 ⊢ Ⅎ𝑦[𝑤 / 𝑦]𝜑
13	11, 12	nfim 1931	. . . . . . . . 9 ⊢ Ⅎ𝑦(∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑)
14	8, 13	nfim 1931	. . . . . . . 8 ⊢ Ⅎ𝑦(𝑤 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))
15		eleq1w 2847	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → (𝑦 ∈ 𝐴 ↔ 𝑤 ∈ 𝐴))
16		predeq3 6323	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑤))
17	16	raleqdv 3323	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑))
18		sbceq1a 3753	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (𝜑 ↔ [𝑤 / 𝑦]𝜑))
19	17, 18	imbi12d 347	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → ((∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑) ↔ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑)))
20	15, 19	imbi12d 347	. . . . . . . 8 ⊢ (𝑦 = 𝑤 → ((𝑦 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑)) ↔ (𝑤 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))))
21		frinsg.1	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑))
22	14, 20, 21	chvarfv 2280	. . . . . . 7 ⊢ (𝑤 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))
23	7, 22	syl5 35	. . . . . 6 ⊢ (𝑤 ∈ 𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → [𝑤 / 𝑦]𝜑))
24	23	anc2li 565	. . . . 5 ⊢ (𝑤 ∈ 𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → (𝑤 ∈ 𝐴 ∧ [𝑤 / 𝑦]𝜑)))
25	3	elrabsf 3787	. . . . 5 ⊢ (𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ (𝑤 ∈ 𝐴 ∧ [𝑤 / 𝑦]𝜑))
26	24, 25	imbitrrdi 255	. . . 4 ⊢ (𝑤 ∈ 𝐴 → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))
27	26	rgen 3082	. . 3 ⊢ ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑})
28		frind 9778	. . 3 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) ∧ ({𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))) → 𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑})
29	1, 27, 28	mpanr12 718	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → 𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑})
30		rabid2 3448	. 2 ⊢ (𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑦 ∈ 𝐴 𝜑)
31	29, 30	sylib 221	1 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  [wsbc 3742   ⊆ wss 3900   Fr wfr 5605   Se wse 5606  Predcpred 6318

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772  ax-inf2 9666

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-oadd 8505  df-ttrcl 9733

This theorem is used by:  frins  9780  frins2f  9781