Theorem frpoinsg 6361

Description: Well-Founded Induction Schema (variant). If a property passes from all elements less than 𝑦 of a well-founded set-like partial order class 𝐴 to 𝑦 itself (induction hypothesis), then the property holds for all elements of 𝐴. (Contributed by Scott Fenton, 11-Feb-2022.)

Hypothesis

Ref	Expression
frpoinsg.1	⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑))

Assertion

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

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

Allowed substitution hint:   𝜑(𝑦)

Proof of Theorem frpoinsg

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfss3 3902	. . . . . . . . 9 ⊢ (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑})
2		nfcv 2926	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦𝐴
3	2	elrabsf 3787	. . . . . . . . . . 11 ⊢ (𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜑))
4	3	simprbi 503	. . . . . . . . . 10 ⊢ (𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} → [𝑧 / 𝑦]𝜑)
5	4	ralimi 3103	. . . . . . . . 9 ⊢ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
6	1, 5	sylbi 220	. . . . . . . 8 ⊢ (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
7		nfv 1949	. . . . . . . . . 10 ⊢ Ⅎ𝑦((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴)
8		nfcv 2926	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦Pred(𝑅, 𝐴, 𝑤)
9		nfsbc1v 3762	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦[𝑧 / 𝑦]𝜑
10	8, 9	nfralw 3313	. . . . . . . . . . 11 ⊢ Ⅎ𝑦∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑
11		nfsbc1v 3762	. . . . . . . . . . 11 ⊢ Ⅎ𝑦[𝑤 / 𝑦]𝜑
12	10, 11	nfim 1931	. . . . . . . . . 10 ⊢ Ⅎ𝑦(∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑)
13	7, 12	nfim 1931	. . . . . . . . 9 ⊢ Ⅎ𝑦(((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))
14		eleq1w 2847	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → (𝑦 ∈ 𝐴 ↔ 𝑤 ∈ 𝐴))
15	14	anbi2d 642	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) ↔ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴)))
16		predeq3 6323	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑤 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑤))
17	16	raleqdv 3323	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑))
18		sbceq1a 3753	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → (𝜑 ↔ [𝑤 / 𝑦]𝜑))
19	17, 18	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → ((∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑) ↔ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑)))
20	15, 19	imbi12d 347	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → ((((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑)) ↔ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))))
21		frpoinsg.1	. . . . . . . . 9 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑))
22	13, 20, 21	chvarfv 2280	. . . . . . . 8 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))
23	6, 22	syl5 35	. . . . . . 7 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → [𝑤 / 𝑦]𝜑))
24		simpr 490	. . . . . . 7 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ 𝐴)
25	23, 24	jctild 535	. . . . . 6 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → (𝑤 ∈ 𝐴 ∧ [𝑤 / 𝑦]𝜑)))
26	2	elrabsf 3787	. . . . . 6 ⊢ (𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ (𝑤 ∈ 𝐴 ∧ [𝑤 / 𝑦]𝜑))
27	25, 26	imbitrrdi 255	. . . . 5 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))
28	27	ralrimiva 3158	. . . 4 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))
29		ssrab2 4008	. . . 4 ⊢ {𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴
30	28, 29	jctil 529	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ({𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑})))
31		frpoind 6360	. . 3 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ ({𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))) → 𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑})
32	30, 31	mpdan 700	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → 𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑})
33		rabid2 3448	. 2 ⊢ (𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑦 ∈ 𝐴 𝜑)
34	32, 33	sylib 221	1 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  [wsbc 3742   ⊆ wss 3900   Po wpo 5561   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-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  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-br 5107  df-opab 5171  df-po 5563  df-fr 5608  df-se 5609  df-xp 5661  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319

This theorem is used by:  frpoins2fg  6362  wfisg  6369