Theorem fpwwe2cbv 10699

Description: Lemma for fpwwe2 10712. (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 4040	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 ⊆ 𝐴 ↔ 𝑎 ⊆ 𝐴))
4		simpr 484	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → 𝑟 = 𝑠)
5	2	sqxpeqd 5732	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑥 × 𝑥) = (𝑎 × 𝑎))
6	4, 5	sseq12d 4042	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ 𝑠 ⊆ (𝑎 × 𝑎)))
7	3, 6	anbi12d 631	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ↔ (𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎))))
8	4, 2	weeq12d 5689	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 We 𝑥 ↔ 𝑠 We 𝑎))
9		id 22	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑣 → 𝑢 = 𝑣)
10	9	sqxpeqd 5732	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑣 → (𝑢 × 𝑢) = (𝑣 × 𝑣))
11	10	ineq2d 4241	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑣 → (𝑟 ∩ (𝑢 × 𝑢)) = (𝑟 ∩ (𝑣 × 𝑣)))
12	9, 11	oveq12d 7466	. . . . . . . . . 10 ⊢ (𝑢 = 𝑣 → (𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))))
13	12	eqeq1d 2742	. . . . . . . . 9 ⊢ (𝑢 = 𝑣 → ((𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦))
14	13	cbvsbcvw 3839	. . . . . . . 8 ⊢ ([(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ [(◡𝑟 “ {𝑦}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦)
15		sneq 4658	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → {𝑦} = {𝑧})
16	15	imaeq2d 6089	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → (◡𝑟 “ {𝑦}) = (◡𝑟 “ {𝑧}))
17		eqeq2 2752	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → ((𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦 ↔ (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧))
18	16, 17	sbceqbid 3811	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ([(◡𝑟 “ {𝑦}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑦 ↔ [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧))
19	14, 18	bitrid 283	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ([(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧))
20	19	cbvralvw 3243	. . . . . 6 ⊢ (∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ ∀𝑧 ∈ 𝑥 [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧)
21	4	cnveqd 5900	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ◡𝑟 = ◡𝑠)
22	21	imaeq1d 6088	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (◡𝑟 “ {𝑧}) = (◡𝑠 “ {𝑧}))
23	4	ineq1d 4240	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑟 ∩ (𝑣 × 𝑣)) = (𝑠 ∩ (𝑣 × 𝑣)))
24	23	oveq2d 7464	. . . . . . . . 9 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = (𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))))
25	24	eqeq1d 2742	. . . . . . . 8 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧 ↔ (𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
26	22, 25	sbceqbid 3811	. . . . . . 7 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ([(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧 ↔ [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
27	2, 26	raleqbidv 3354	. . . . . 6 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑧 ∈ 𝑥 [(◡𝑟 “ {𝑧}) / 𝑣](𝑣𝐹(𝑟 ∩ (𝑣 × 𝑣))) = 𝑧 ↔ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
28	20, 27	bitrid 283	. . . . 5 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))
29	8, 28	anbi12d 631	. . . 4 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → ((𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦) ↔ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧)))
30	7, 29	anbi12d 631	. . 3 ⊢ ((𝑥 = 𝑎 ∧ 𝑟 = 𝑠) → (((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) ↔ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))))
31	30	cbvopabv 5239	. 2 ⊢ {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))} = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}
32	1, 31	eqtri 2768	1 ⊢ 𝑊 = {⟨𝑎, 𝑠⟩ ∣ ((𝑎 ⊆ 𝐴 ∧ 𝑠 ⊆ (𝑎 × 𝑎)) ∧ (𝑠 We 𝑎 ∧ ∀𝑧 ∈ 𝑎 [(◡𝑠 “ {𝑧}) / 𝑣](𝑣𝐹(𝑠 ∩ (𝑣 × 𝑣))) = 𝑧))}

Syntax hints:   ∧ wa 395   = wceq 1537  ∀wral 3067  [wsbc 3804   ∩ cin 3975   ⊆ wss 3976  {csn 4648  {copab 5228   We wwe 5651   × cxp 5698  ^◡ccnv 5699   “ cima 5703  (class class class)co 7448

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-cnv 5708  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fv 6581  df-ov 7451

This theorem is referenced by:  fpwwe2lem11  10710  fpwwe2lem12  10711  canthwe  10720  pwfseqlem5  10732