Theorem fpwwecbv 10567

Description: Lemma for fpwwe 10569. (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 482	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → 𝑥 = 𝑎)
3	2	sseq1d 3967	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 ⊆ 𝐴 ↔ 𝑎 ⊆ 𝐴))
4		simpr 484	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → 𝑟 = 𝑠)
5	2	sqxpeqd 5664	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 × 𝑥) = (𝑎 × 𝑎))
6	4, 5	sseq12d 3969	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ 𝑠 ⊆ (𝑎 × 𝑎)))
7	3, 6	anbi12d 633	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ↔ (𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎))))
8	4, 2	weeq12d 5621	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 We 𝑥 ↔ 𝑠 We 𝑎))
9		sneq 4592	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → {𝑦} = {𝑧})
10	9	imaeq2d 6027	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (◡𝑟 “ {𝑦}) = (◡𝑟 “ {𝑧}))
11	10	fveq2d 6846	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → (𝐹‘(◡𝑟 “ {𝑦})) = (𝐹‘(◡𝑟 “ {𝑧})))
12		id 22	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → 𝑦 = 𝑧)
13	11, 12	eqeq12d 2753	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ((𝐹‘(◡𝑟 “ {𝑦})) = 𝑦 ↔ (𝐹‘(◡𝑟 “ {𝑧})) = 𝑧))
14	13	cbvralvw 3216	. . . . . 6 ⊢ (∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦 ↔ ∀𝑧 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑧})) = 𝑧)
15	4	cnveqd 5832	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ◡𝑟 = ◡𝑠)
16	15	imaeq1d 6026	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (◡𝑟 “ {𝑧}) = (◡𝑠 “ {𝑧}))
17	16	fveqeq2d 6850	. . . . . . 7 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝐹‘(◡𝑟 “ {𝑧})) = 𝑧 ↔ (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))
18	2, 17	raleqbidv 3318	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑧 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑧})) = 𝑧 ↔ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))
19	14, 18	bitrid 283	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦 ↔ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))
20	8, 19	anbi12d 633	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦) ↔ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧)))
21	7, 20	anbi12d 633	. . 3 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦)) ↔ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))))
22	21	cbvopabv 5173	. 2 ⊢ {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝐹‘(◡𝑟 “ {𝑦})) = 𝑦))} = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))}
23	1, 22	eqtri 2760	1 ⊢ 𝑊 = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 (𝐹‘(◡𝑠 “ {𝑧})) = 𝑧))}

Syntax hints:   ∧ wa 395   = wceq 1542  ∀wral 3052   ⊆ wss 3903  {csn 4582  {copab 5162   We wwe 5584   × cxp 5630  ^◡ccnv 5631   “ cima 5635  ‘cfv 6500

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-cnv 5640  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fv 6508

This theorem is referenced by:  canthnum  10572  canthp1  10577