Theorem fpwwe2lem4 10623

Description: Lemma for fpwwe2 10632. (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 485	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝐴 ∈ 𝑉)
3		simpr1 1213	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝑋 ⊆ 𝐴)
4	2, 3	ssexd 5295	. . 3 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝑋 ∈ V)
5	4, 4	xpexd 7746	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → (𝑋 × 𝑋) ∈ V)
6		simpr2 1214	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝑅 ⊆ (𝑋 × 𝑋))
7	5, 6	ssexd 5295	. . 3 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → 𝑅 ∈ V)
8		simpl 487	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → 𝑥 = 𝑋)
9	8	sseq1d 3968	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑥 ⊆ 𝐴 ↔ 𝑋 ⊆ 𝐴))
10		simpr 489	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → 𝑟 = 𝑅)
11	8	sqxpeqd 5693	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑥 × 𝑥) = (𝑋 × 𝑋))
12	10, 11	sseq12d 3970	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ 𝑅 ⊆ (𝑋 × 𝑋)))
13	10, 8	weeq12d 5650	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑟 We 𝑥 ↔ 𝑅 We 𝑋))
14	9, 12, 13	3anbi123d 1464	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ↔ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)))
15		oveq12 7419	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (𝑥𝐹𝑟) = (𝑋𝐹𝑅))
16	15	eleq1d 2848	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → ((𝑥𝐹𝑟) ∈ 𝐴 ↔ (𝑋𝐹𝑅) ∈ 𝐴))
17	14, 16	imbi12d 347	. . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑟 = 𝑅) → (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥𝐹𝑟) ∈ 𝐴) ↔ ((𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋) → (𝑋𝐹𝑅) ∈ 𝐴)))
18		fpwwe2.3	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴)
19	18	ex 417	. . . 4 ⊢ (𝜑 → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥𝐹𝑟) ∈ 𝐴))
20	19	adantr 485	. . 3 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → (𝑥𝐹𝑟) ∈ 𝐴))
21	4, 7, 17, 20	vtocl2d 3528	. 2 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → ((𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋) → (𝑋𝐹𝑅) ∈ 𝐴))
22	21	syldbl2 854	1 ⊢ ((𝜑 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑅 ⊆ (𝑋 × 𝑋) ∧ 𝑅 We 𝑋)) → (𝑋𝐹𝑅) ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  ∀wral 3079  Vcvv 3455  [wsbc 3744   ∩ cin 3904   ⊆ wss 3905  {csn 4589  {copab 5173   We wwe 5613   × cxp 5659  ^◡ccnv 5660   “ cima 5664  (class class class)co 7410

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pow 5336  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-iota 6492  df-fv 6544  df-ov 7413

This theorem is used by:  fpwwe2lem12  10631