Theorem fpwwe2cbv 10583

Description: Lemma for fpwwe2 10596. (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 482	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → 𝑥 = 𝑎)
3	2	sseq1d 3978	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 ⊆ 𝐴 ↔ 𝑎 ⊆ 𝐴))
4		simpr 484	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → 𝑟 = 𝑠)
5	2	sqxpeqd 5670	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 × 𝑥) = (𝑎 × 𝑎))
6	4, 5	sseq12d 3980	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ 𝑠 ⊆ (𝑎 × 𝑎)))
7	3, 6	anbi12d 632	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ↔ (𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎))))
8	4, 2	weeq12d 5627	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 We 𝑥 ↔ 𝑠 We 𝑎))
9		id 22	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑣 → 𝑢 = 𝑣)
10	9	sqxpeqd 5670	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑣 → (𝑢 × 𝑢) = (𝑣 × 𝑣))
11	10	ineq2d 4183	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑣 → (𝑟 ∩ (𝑢 × 𝑢)) = (𝑟 ∩ (𝑣 × 𝑣)))
12	9, 11	oveq12d 7405	. . . . . . . . . 10 ⊢ (𝑢 = 𝑣 → (𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))))
13	12	eqeq1d 2731	. . . . . . . . 9 ⊢ (𝑢 = 𝑣 → ((𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦))
14	13	cbvsbcvw 3787	. . . . . . . 8 ⊢ ([(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ [(◡𝑟 “ {𝑦}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦)
15		sneq 4599	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → {𝑦} = {𝑧})
16	15	imaeq2d 6031	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (◡𝑟 “ {𝑦}) = (◡𝑟 “ {𝑧}))
17		eqeq2 2741	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → ((𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦 ↔ (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧))
18	16, 17	sbceqbid 3760	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ([(◡𝑟 “ {𝑦}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦 ↔ [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧))
19	14, 18	bitrid 283	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ([(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧))
20	19	cbvralvw 3215	. . . . . 6 ⊢ (∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ ∀𝑧 ∈ 𝑥 [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧)
21	4	cnveqd 5839	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ◡𝑟 = ◡𝑠)
22	21	imaeq1d 6030	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (◡𝑟 “ {𝑧}) = (◡𝑠 “ {𝑧}))
23	4	ineq1d 4182	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 ∩ (𝑣 × 𝑣)) = (𝑠 ∩ (𝑣 × 𝑣)))
24	23	oveq2d 7403	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = (𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))))
25	24	eqeq1d 2731	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧 ↔ (𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
26	22, 25	sbceqbid 3760	. . . . . . 7 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ([(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧 ↔ [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
27	2, 26	raleqbidv 3319	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑧 ∈ 𝑥 [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧 ↔ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
28	20, 27	bitrid 283	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
29	8, 28	anbi12d 632	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦) ↔ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧)))
30	7, 29	anbi12d 632	. . 3 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) ↔ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))))
31	30	cbvopabv 5180	. 2 ⊢ {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))} = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}
32	1, 31	eqtri 2752	1 ⊢ 𝑊 = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}

Syntax hints:   ∧ wa 395   = wceq 1540  ∀wral 3044  [wsbc 3753   ∩ cin 3913   ⊆ wss 3914  {csn 4589  {copab 5169   We wwe 5590   × cxp 5636  ^◡ccnv 5637   “ cima 5641  (class class class)co 7387

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-cnv 5646  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fv 6519  df-ov 7390

This theorem is referenced by:  fpwwe2lem11  10594  fpwwe2lem12  10595  canthwe  10604  pwfseqlem5  10616