Theorem frpoinsg 6345

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 3954	. . . . . . . . 9 ⊢ (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑})
2		nfcv 2897	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦𝐴
3	2	elrabsf 3818	. . . . . . . . . . 11 ⊢ (𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜑))
4	3	simprbi 496	. . . . . . . . . 10 ⊢ (𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} → [𝑧 / 𝑦]𝜑)
5	4	ralimi 3072	. . . . . . . . 9 ⊢ (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)𝑧 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
6	1, 5	sylbi 217	. . . . . . . 8 ⊢ (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑)
7		nfv 1913	. . . . . . . . . 10 ⊢ Ⅎ𝑦((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴)
8		nfcv 2897	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦Pred(𝑅, 𝐴, 𝑤)
9		nfsbc1v 3792	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦[𝑧 / 𝑦]𝜑
10	8, 9	nfralw 3295	. . . . . . . . . . 11 ⊢ Ⅎ𝑦∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑
11		nfsbc1v 3792	. . . . . . . . . . 11 ⊢ Ⅎ𝑦[𝑤 / 𝑦]𝜑
12	10, 11	nfim 1895	. . . . . . . . . 10 ⊢ Ⅎ𝑦(∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑)
13	7, 12	nfim 1895	. . . . . . . . 9 ⊢ Ⅎ𝑦(((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑 → [𝑤 / 𝑦]𝜑))
14		eleq1w 2816	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → (𝑦 ∈ 𝐴 ↔ 𝑤 ∈ 𝐴))
15	14	anbi2d 630	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) ↔ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴)))
16		predeq3 6307	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑤 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑤))
17	16	raleqdv 3310	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 ↔ ∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑤)[𝑧 / 𝑦]𝜑))
18		sbceq1a 3783	. . . . . . . . . . 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 2239	. . . . . . . 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 3818	. . . . . 6 ⊢ (𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ (𝑤 ∈ 𝐴 ∧ [𝑤 / 𝑦]𝜑))
27	25, 26	imbitrrdi 252	. . . . 5 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑤 ∈ 𝐴) → (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))
28	27	ralrimiva 3133	. . . 4 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))
29		ssrab2 4062	. . . 4 ⊢ {𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴
30	28, 29	jctil 519	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ({𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑})))
31		frpoind 6344	. . 3 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ ({𝑦 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑤) ⊆ {𝑦 ∈ 𝐴 ∣ 𝜑} → 𝑤 ∈ {𝑦 ∈ 𝐴 ∣ 𝜑}))) → 𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑})
32	30, 31	mpdan 687	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → 𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑})
33		rabid2 3454	. 2 ⊢ (𝐴 = {𝑦 ∈ 𝐴 ∣ 𝜑} ↔ ∀𝑦 ∈ 𝐴 𝜑)
34	32, 33	sylib 218	1 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1539   ∈ wcel 2107  ∀wral 3050  {crab 3420  [wsbc 3772   ⊆ wss 3933   Po wpo 5572   Fr wfr 5616   Se wse 5617  Predcpred 6302

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-sep 5278  ax-nul 5288  ax-pr 5414

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3421  df-v 3466  df-sbc 3773  df-dif 3936  df-un 3938  df-in 3940  df-ss 3950  df-nul 4316  df-if 4508  df-pw 4584  df-sn 4609  df-pr 4611  df-op 4615  df-br 5126  df-opab 5188  df-po 5574  df-fr 5619  df-se 5620  df-xp 5673  df-cnv 5675  df-dm 5677  df-rn 5678  df-res 5679  df-ima 5680  df-pred 6303

This theorem is referenced by:  frpoins2fg  6346  wfisg  6355