Theorem fpwwe2lem4 10646

Description: Lemma for fpwwe2 10655. (Contributed by Mario Carneiro, 15-May-2015.) (Revised by AV, 20-Jul-2024.) (Proof shortened by Matthew House, 10-Sep-2025.)

Hypotheses

Ref	Expression
fpwwe2.1	⊢ 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))}
fpwwe2.2	⊢ (𝜑 → 𝐴 ∈ 𝑉)
fpwwe2.3	⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴)

Assertion

Ref	Expression
fpwwe2lem4	⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → (𝑋𝐹𝑅) ∈ 𝐴)

Distinct variable groups:   𝑦,𝑢,𝑟,𝑥,𝐹   𝑋,𝑟,𝑢,𝑥,𝑦   𝜑,𝑟,𝑢,𝑥,𝑦   𝐴,𝑟,𝑥   𝑅,𝑟,𝑢,𝑥,𝑦   𝑊,𝑟,𝑢,𝑥,𝑦

Allowed substitution hints:   𝐴(𝑦, 𝑢)   𝑉(𝑥, 𝑦, 𝑢, 𝑟)

Proof of Theorem fpwwe2lem4

Step	Hyp	Ref	Expression
1		fpwwe2.2	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2	1	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝐴 ∈ 𝑉)
3		simpr1 1213	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝑋 ⊆ 𝐴)
4	2, 3	ssexd 5289	. . 3 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝑋 ∈ V)
5	4, 4	xpexd 7751	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → (𝑋 × 𝑋) ∈ V)
6		simpr2 1214	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝑅 ⊆ (𝑋 × 𝑋))
7	5, 6	ssexd 5289	. . 3 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝑅 ∈ V)
8		simpl 488	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → 𝑥 = 𝑋)
9	8	sseq1d 3962	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑥 ⊆ 𝐴 ↔ 𝑋 ⊆ 𝐴))
10		simpr 490	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → 𝑟 = 𝑅)
11	8	sqxpeqd 5687	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑥 × 𝑥) = (𝑋 × 𝑋))
12	10, 11	sseq12d 3964	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ 𝑅 ⊆ (𝑋 × 𝑋)))
13	10, 8	weeq12d 5644	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑟 We 𝑥 ↔ 𝑅 We 𝑋))
14	9, 12, 13	3anbi123d 1464	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ↔ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)))
15		oveq12 7423	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑥𝐹𝑟) = (𝑋𝐹𝑅))
16	15	eleq1d 2845	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → ((𝑥𝐹𝑟) ∈ 𝐴 ↔ (𝑋𝐹𝑅) ∈ 𝐴))
17	14, 16	imbi12d 347	. . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥𝐹𝑟) ∈ 𝐴) ↔ ((𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋) → (𝑋𝐹𝑅) ∈ 𝐴)))
18		fpwwe2.3	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴)
19	18	ex 418	. . . 4 ⊢ (𝜑 → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥𝐹𝑟) ∈ 𝐴))
20	19	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥𝐹𝑟) ∈ 𝐴))
21	4, 7, 17, 20	vtocl2d 3523	. 2 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → ((𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋) → (𝑋𝐹𝑅) ∈ 𝐴))
22	21	syldbl2 855	1 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → (𝑋𝐹𝑅) ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076  Vcvv 3450  [wsbc 3739   ∩ cin 3898   ⊆ wss 3899  {csn 4584  {copab 5167   We wwe 5607   × cxp 5653  ^◡ccnv 5654   “ cima 5658  (class class class)co 7414

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-iota 6489  df-fv 6541  df-ov 7417

This theorem is used by:  fpwwe2lem12  10654