Theorem fpwwecbv 10641

Description: Lemma for fpwwe 10643. (Contributed by Mario Carneiro, 15-May-2015.)

Hypothesis

Ref	Expression
fpwwe.1	⊢ 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦))}

Assertion

Ref	Expression
fpwwecbv	⊢ 𝑊 = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))}

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

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

Proof of Theorem fpwwecbv

Step	Hyp	Ref	Expression
1		fpwwe.1	. 2 ⊢ 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦))}
2		simpl 481	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → 𝑥 = 𝑎)
3	2	sseq1d 4012	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 ⊆ 𝐴 ↔ 𝑎 ⊆ 𝐴))
4		simpr 483	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → 𝑟 = 𝑠)
5	2	sqxpeqd 5707	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 × 𝑥) = (𝑎 × 𝑎))
6	4, 5	sseq12d 4014	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ 𝑠 ⊆ (𝑎 × 𝑎)))
7	3, 6	anbi12d 629	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ↔ (𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎))))
8		weeq2 5664	. . . . . 6 ⊢ (𝑥 = 𝑎 → (𝑟 We 𝑥 ↔ 𝑟 We 𝑎))
9		weeq1 5663	. . . . . 6 ⊢ (𝑟 = 𝑠 → (𝑟 We 𝑎 ↔ 𝑠 We 𝑎))
10	8, 9	sylan9bb 508	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 We 𝑥 ↔ 𝑠 We 𝑎))
11		sneq 4637	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → {𝑦} = {𝑧})
12	11	imaeq2d 6058	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (◡𝑟 “ {𝑦}) = (◡𝑟 “ {𝑧}))
13	12	fveq2d 6894	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → (𝐹‘(◡𝑟 “ {𝑦})) = (𝐹‘(◡𝑟 “ {𝑧})))
14		id 22	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → 𝑦 = 𝑧)
15	13, 14	eqeq12d 2746	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ((𝐹‘(◡𝑟 “ {𝑦})) = 𝑦 ↔ (𝐹‘(◡𝑟 “ {𝑧})) = 𝑧))
16	15	cbvralvw 3232	. . . . . 6 ⊢ (∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦 ↔ ∀𝑧 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑧})) = 𝑧)
17	4	cnveqd 5874	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ◡𝑟 = ◡𝑠)
18	17	imaeq1d 6057	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (◡𝑟 “ {𝑧}) = (◡𝑠 “ {𝑧}))
19	18	fveqeq2d 6898	. . . . . . 7 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝐹‘(◡𝑟 “ {𝑧})) = 𝑧 ↔ (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))
20	2, 19	raleqbidv 3340	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑧 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑧})) = 𝑧 ↔ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))
21	16, 20	bitrid 282	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦 ↔ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))
22	10, 21	anbi12d 629	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦) ↔ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧)))
23	7, 22	anbi12d 629	. . 3 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦)) ↔ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))))
24	23	cbvopabv 5220	. 2 ⊢ {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦))} = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))}
25	1, 24	eqtri 2758	1 ⊢ 𝑊 = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))}

Syntax hints:   ∧ wa 394   = wceq 1539  ∀wral 3059   ⊆ wss 3947  {csn 4627  {copab 5209   We wwe 5629   × cxp 5673  ^◡ccnv 5674   “ cima 5678  ‘cfv 6542

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 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-ext 2701

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2722  df-clel 2808  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-cnv 5683  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6494  df-fv 6550

This theorem is referenced by:  canthnum  10646  canthp1  10651