Theorem predtrss 6214

Description: If 𝑅 is transitive over 𝐴 and 𝑌𝑅𝑋, then Pred(𝑅, 𝐴, 𝑌) is a subclass of Pred(𝑅, 𝐴, 𝑋). (Contributed by Scott Fenton, 28-Oct-2024.)

Assertion

Ref	Expression
predtrss	⊢ ((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → Pred(𝑅, 𝐴, 𝑌) ⊆ Pred(𝑅, 𝐴, 𝑋))

Proof of Theorem predtrss

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 484	. . . . . 6 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ 𝐴)
2		predel 6212	. . . . . . . 8 ⊢ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑌 ∈ 𝐴)
3	2	3ad2ant2 1132	. . . . . . 7 ⊢ ((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → 𝑌 ∈ 𝐴)
4	3	adantr 480	. . . . . 6 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → 𝑌 ∈ 𝐴)
5		brxp 5627	. . . . . 6 ⊢ (𝑧(𝐴 × 𝐴)𝑌 ↔ (𝑧 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴))
6	1, 4, 5	sylanbrc 582	. . . . 5 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → 𝑧(𝐴 × 𝐴)𝑌)
7		brin 5122	. . . . . 6 ⊢ (𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑌 ↔ (𝑧𝑅𝑌 ∧ 𝑧(𝐴 × 𝐴)𝑌))
8		predbrg 6213	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋)) → 𝑌𝑅𝑋)
9	8	ancoms 458	. . . . . . . . . 10 ⊢ ((𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → 𝑌𝑅𝑋)
10	9	3adant1 1128	. . . . . . . . 9 ⊢ ((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → 𝑌𝑅𝑋)
11	10	adantr 480	. . . . . . . 8 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → 𝑌𝑅𝑋)
12		simpl3 1191	. . . . . . . . 9 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → 𝑋 ∈ 𝐴)
13		brxp 5627	. . . . . . . . 9 ⊢ (𝑌(𝐴 × 𝐴)𝑋 ↔ (𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝐴))
14	4, 12, 13	sylanbrc 582	. . . . . . . 8 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → 𝑌(𝐴 × 𝐴)𝑋)
15		brin 5122	. . . . . . . 8 ⊢ (𝑌(𝑅 ∩ (𝐴 × 𝐴))𝑋 ↔ (𝑌𝑅𝑋 ∧ 𝑌(𝐴 × 𝐴)𝑋))
16	11, 14, 15	sylanbrc 582	. . . . . . 7 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → 𝑌(𝑅 ∩ (𝐴 × 𝐴))𝑋)
17		breq2 5074	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑌 → (𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦 ↔ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑌))
18		breq1 5073	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑌 → (𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑋 ↔ 𝑌(𝑅 ∩ (𝐴 × 𝐴))𝑋))
19	17, 18	anbi12d 630	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑌 → ((𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∧ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑋) ↔ (𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑌 ∧ 𝑌(𝑅 ∩ (𝐴 × 𝐴))𝑋)))
20	19	spcegv 3526	. . . . . . . . . . 11 ⊢ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → ((𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑌 ∧ 𝑌(𝑅 ∩ (𝐴 × 𝐴))𝑋) → ∃𝑦(𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∧ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑋)))
21	20	3ad2ant2 1132	. . . . . . . . . 10 ⊢ ((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → ((𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑌 ∧ 𝑌(𝑅 ∩ (𝐴 × 𝐴))𝑋) → ∃𝑦(𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∧ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑋)))
22	21	adantr 480	. . . . . . . . 9 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → ((𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑌 ∧ 𝑌(𝑅 ∩ (𝐴 × 𝐴))𝑋) → ∃𝑦(𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∧ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑋)))
23		vex 3426	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
24		brcog 5764	. . . . . . . . . 10 ⊢ ((𝑧 ∈ V ∧ 𝑋 ∈ 𝐴) → (𝑧((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴)))𝑋 ↔ ∃𝑦(𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∧ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑋)))
25	23, 12, 24	sylancr 586	. . . . . . . . 9 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → (𝑧((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴)))𝑋 ↔ ∃𝑦(𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∧ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑋)))
26	22, 25	sylibrd 258	. . . . . . . 8 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → ((𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑌 ∧ 𝑌(𝑅 ∩ (𝐴 × 𝐴))𝑋) → 𝑧((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴)))𝑋))
27		simpl1 1189	. . . . . . . . 9 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → ((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅)
28	27	ssbrd 5113	. . . . . . . 8 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → (𝑧((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴)))𝑋 → 𝑧𝑅𝑋))
29	26, 28	syld 47	. . . . . . 7 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → ((𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑌 ∧ 𝑌(𝑅 ∩ (𝐴 × 𝐴))𝑋) → 𝑧𝑅𝑋))
30	16, 29	mpan2d 690	. . . . . 6 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → (𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑌 → 𝑧𝑅𝑋))
31	7, 30	syl5bir 242	. . . . 5 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → ((𝑧𝑅𝑌 ∧ 𝑧(𝐴 × 𝐴)𝑌) → 𝑧𝑅𝑋))
32	6, 31	mpan2d 690	. . . 4 ⊢ (((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) ∧ 𝑧 ∈ 𝐴) → (𝑧𝑅𝑌 → 𝑧𝑅𝑋))
33	32	imdistanda 571	. . 3 ⊢ ((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → ((𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑌) → (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑋)))
34	23	elpred 6208	. . . 4 ⊢ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑌) ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑌)))
35	34	3ad2ant2 1132	. . 3 ⊢ ((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑌) ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑌)))
36	23	elpred 6208	. . . 4 ⊢ (𝑋 ∈ 𝐴 → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑋)))
37	36	3ad2ant3 1133	. . 3 ⊢ ((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑋)))
38	33, 35, 37	3imtr4d 293	. 2 ⊢ ((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑌) → 𝑧 ∈ Pred(𝑅, 𝐴, 𝑋)))
39	38	ssrdv 3923	1 ⊢ ((((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ 𝑅 ∧ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ∧ 𝑋 ∈ 𝐴) → Pred(𝑅, 𝐴, 𝑌) ⊆ Pred(𝑅, 𝐴, 𝑋))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539  ∃wex 1783   ∈ wcel 2108  Vcvv 3422   ∩ cin 3882   ⊆ wss 3883   class class class wbr 5070   × cxp 5578   ∘ ccom 5584  Predcpred 6190

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-xp 5586  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191

This theorem is referenced by:  predpo  6215