frege97d - Mathbox for Richard Penner

	Mathbox for Richard Penner		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > frege97d		Structured version Visualization version GIF version

Theorem frege97d 43935

Description: If 𝐴 contains all elements after those in 𝑈 in the transitive closure of 𝑅, then the image under 𝑅 of 𝐴 is a subclass of 𝐴. Similar to Proposition 97 of [Frege1879] p. 71. Compare with frege97 44143. (Contributed by RP, 15-Jul-2020.)

**Hypotheses**
Ref	Expression
frege97d.r	⊢ (𝜑 → 𝑅 ∈ V)
frege97d.a	⊢ (𝜑 → 𝐴 = ((t+‘𝑅) “ 𝑈))

**Assertion**
Ref	Expression
frege97d	⊢ (𝜑 → (𝑅 “ 𝐴) ⊆ 𝐴)

**Proof of Theorem frege97d**
Step	Hyp	Ref	Expression
1		frege97d.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ V)
2		trclfvlb 14929	. . . . 5 ⊢ (𝑅 ∈ V → 𝑅 ⊆ (t+‘𝑅))
3		coss1 5802	. . . . 5 ⊢ (𝑅 ⊆ (t+‘𝑅) → (𝑅 ∘ (t+‘𝑅)) ⊆ ((t+‘𝑅) ∘ (t+‘𝑅)))
4	1, 2, 3	3syl 18	. . . 4 ⊢ (𝜑 → (𝑅 ∘ (t+‘𝑅)) ⊆ ((t+‘𝑅) ∘ (t+‘𝑅)))
5		trclfvcotrg 14937	. . . 4 ⊢ ((t+‘𝑅) ∘ (t+‘𝑅)) ⊆ (t+‘𝑅)
6	4, 5	sstrdi 3944	. . 3 ⊢ (𝜑 → (𝑅 ∘ (t+‘𝑅)) ⊆ (t+‘𝑅))
7		imass1 6058	. . 3 ⊢ ((𝑅 ∘ (t+‘𝑅)) ⊆ (t+‘𝑅) → ((𝑅 ∘ (t+‘𝑅)) “ 𝑈) ⊆ ((t+‘𝑅) “ 𝑈))
8	6, 7	syl 17	. 2 ⊢ (𝜑 → ((𝑅 ∘ (t+‘𝑅)) “ 𝑈) ⊆ ((t+‘𝑅) “ 𝑈))
9		frege97d.a	. . . 4 ⊢ (𝜑 → 𝐴 = ((t+‘𝑅) “ 𝑈))
10	9	imaeq2d 6017	. . 3 ⊢ (𝜑 → (𝑅 “ 𝐴) = (𝑅 “ ((t+‘𝑅) “ 𝑈)))
11		imaco 6207	. . 3 ⊢ ((𝑅 ∘ (t+‘𝑅)) “ 𝑈) = (𝑅 “ ((t+‘𝑅) “ 𝑈))
12	10, 11	eqtr4di 2787	. 2 ⊢ (𝜑 → (𝑅 “ 𝐴) = ((𝑅 ∘ (t+‘𝑅)) “ 𝑈))
13	8, 12, 9	3sstr4d 3987	1 ⊢ (𝜑 → (𝑅 “ 𝐴) ⊆ 𝐴)

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 Vcvv 3438 ⊆ wss 3899 “ cima 5625 ∘ ccom 5626 ‘cfv 6490 t+ctcl 14906

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fv 6498 df-trcl 14908

This theorem is referenced by: (None)

W3C validator