Theorem frpoinsg 6300

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 3921	. . . . . . . . 9 ⊢ (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑})
2		nfcv 2897	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦𝐴
3	2	elrabsf 3785	. . . . . . . . . . 11 ⊢ (𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜑))
4	3	simprbi 496	. . . . . . . . . 10 ⊢ (𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} → [𝑧 / 𝑦]𝜑)
5	4	ralimi 3072	. . . . . . . . 9 ⊢ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
6	1, 5	sylbi 217	. . . . . . . 8 ⊢ (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
7		nfv 1916	. . . . . . . . . 10 ⊢ Ⅎ𝑦((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴)
8		nfcv 2897	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦Pred(𝑅, 𝐴, 𝑤)
9		nfsbc1v 3759	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦[𝑧 / 𝑦]𝜑
10	8, 9	nfralw 3282	. . . . . . . . . . 11 ⊢ Ⅎ𝑦∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑
11		nfsbc1v 3759	. . . . . . . . . . 11 ⊢ Ⅎ𝑦[𝑤 / 𝑦]𝜑
12	10, 11	nfim 1898	. . . . . . . . . 10 ⊢ Ⅎ𝑦(∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑)
13	7, 12	nfim 1898	. . . . . . . . 9 ⊢ Ⅎ𝑦(((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))
14		eleq1w 2818	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → (𝑦 ∈ 𝐴 ↔ 𝑤 ∈ 𝐴))
15	14	anbi2d 631	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) ↔ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴)))
16		predeq3 6262	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑤 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑤))
17	16	raleqdv 3295	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑))
18		sbceq1a 3750	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → (𝜑 ↔ [𝑤 / 𝑦]𝜑))
19	17, 18	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → ((∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑) ↔ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑)))
20	15, 19	imbi12d 344	. . . . . . . . 9 ⊢ (𝑦 = 𝑤 → ((((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑)) ↔ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))))
21		frpoinsg.1	. . . . . . . . 9 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑))
22	13, 20, 21	chvarfv 2246	. . . . . . . 8 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))
23	6, 22	syl5 34	. . . . . . 7 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → [𝑤 / 𝑦]𝜑))
24		simpr 484	. . . . . . 7 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ 𝐴)
25	23, 24	jctild 525	. . . . . 6 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → (𝑤 ∈ 𝐴 ∧ [𝑤 / 𝑦]𝜑)))
26	2	elrabsf 3785	. . . . . 6 ⊢ (𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ (𝑤 ∈ 𝐴 ∧ [𝑤 / 𝑦]𝜑))
27	25, 26	imbitrrdi 252	. . . . 5 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))
28	27	ralrimiva 3127	. . . 4 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))
29		ssrab2 4031	. . . 4 ⊢ {𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴
30	28, 29	jctil 519	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ({𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑})))
31		frpoind 6299	. . 3 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ ({𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))) → 𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑})
32	30, 31	mpdan 688	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → 𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑})
33		rabid2 3431	. 2 ⊢ (𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑦 ∈ 𝐴 𝜑)
34	32, 33	sylib 218	1 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3050  {crab 3398  [wsbc 3739   ⊆ wss 3900   Po wpo 5529   Fr wfr 5573   Se wse 5574  Predcpred 6257

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-sbc 3740  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098  df-opab 5160  df-po 5531  df-fr 5576  df-se 5577  df-xp 5629  df-cnv 5631  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6258

This theorem is referenced by:  frpoins2fg  6301  wfisg  6308