Theorem fpwwe2cbv 10754

Description: Lemma for fpwwe2 10767. (Contributed by Mario Carneiro, 3-Jun-2015.)

Hypothesis

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

Assertion

Ref	Expression
fpwwe2cbv	⊢ 𝑊 = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}

Distinct variable groups:   𝑦,𝑢   𝑟,𝑎,𝑠,𝑢,𝑣,𝑥,𝑦,𝑧,𝐹   𝐴,𝑎,𝑟,𝑠,𝑥,𝑧

Allowed substitution hints:   𝐴(𝑦, 𝑣, 𝑢)   𝑊(𝑥, 𝑦, 𝑧, 𝑣, 𝑢, 𝑠, 𝑟, 𝑎)

Proof of Theorem fpwwe2cbv

Step	Hyp	Ref	Expression
1		fpwwe2.1	. 2 ⊢ 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))}
2		simpl 488	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → 𝑥 = 𝑎)
3	2	sseq1d 3944	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 ⊆ 𝐴 ↔ 𝑎 ⊆ 𝐴))
4		simpr 490	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → 𝑟 = 𝑠)
5	2	sqxpeqd 5690	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 × 𝑥) = (𝑎 × 𝑎))
6	4, 5	sseq12d 3946	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ 𝑠 ⊆ (𝑎 × 𝑎)))
7	3, 6	anbi12d 644	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ↔ (𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎))))
8	4, 2	weeq12d 5647	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 We 𝑥 ↔ 𝑠 We 𝑎))
9		id 23	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑣 → 𝑢 = 𝑣)
10	9	sqxpeqd 5690	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑣 → (𝑢 × 𝑢) = (𝑣 × 𝑣))
11	10	ineq2d 4120	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑣 → (𝑟 ∩ (𝑢 × 𝑢)) = (𝑟 ∩ (𝑣 × 𝑣)))
12	9, 11	oveq12d 7469	. . . . . . . . . 10 ⊢ (𝑢 = 𝑣 → (𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))))
13	12	eqeq1d 2765	. . . . . . . . 9 ⊢ (𝑢 = 𝑣 → ((𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦))
14	13	cbvsbcvw 3776	. . . . . . . 8 ⊢ ([(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ [(◡𝑟 “ {𝑦}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦)
15		sneq 4594	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → {𝑦} = {𝑧})
16	15	imaeq2d 6070	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (◡𝑟 “ {𝑦}) = (◡𝑟 “ {𝑧}))
17		eqeq2 2775	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → ((𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦 ↔ (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧))
18	16, 17	sbceqbid 3749	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ([(◡𝑟 “ {𝑦}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦 ↔ [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧))
19	14, 18	bitrid 286	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ([(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧))
20	19	cbvralvw 3244	. . . . . 6 ⊢ (∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ ∀𝑧 ∈ 𝑥 [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧)
21	4	cnveqd 5865	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ◡𝑟 = ◡𝑠)
22	21	imaeq1d 6069	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (◡𝑟 “ {𝑧}) = (◡𝑠 “ {𝑧}))
23	4	ineq1d 4119	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 ∩ (𝑣 × 𝑣)) = (𝑠 ∩ (𝑣 × 𝑣)))
24	23	oveq2d 7467	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = (𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))))
25	24	eqeq1d 2765	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧 ↔ (𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
26	22, 25	sbceqbid 3749	. . . . . . 7 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ([(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧 ↔ [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
27	2, 26	raleqbidv 3338	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑧 ∈ 𝑥 [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧 ↔ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
28	20, 27	bitrid 286	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
29	8, 28	anbi12d 644	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦) ↔ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧)))
30	7, 29	anbi12d 644	. . 3 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) ↔ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))))
31	30	cbvopabv 5184	. 2 ⊢ {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))} = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}
32	1, 31	eqtri 2786	1 ⊢ 𝑊 = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∀wral 3080  [wsbc 3742   ⊆ wss 3900   ∩ cin 4092  {csn 4588  {copab 5173   We wwe 5610   × cxp 5656  ^◡ccnv 5657   “ cima 5661  (class class class)co 7451

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fv 6574  df-ov 7454

This theorem is used by:  fpwwe2lem11  10765  fpwwe2lem12  10766  canthwe  10775  pwfseqlem5  10787