Theorem sprsymrelfvlem 48272

Description: Lemma for sprsymrelf 48277 and sprsymrelfv 48276. (Contributed by AV, 19-Nov-2021.)

Assertion

Ref	Expression
sprsymrelfvlem	⊢ (𝑃 ⊆ (Pairs‘𝑉) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉))

Distinct variable groups:   𝑃,𝑐,𝑥,𝑦   𝑉,𝑐,𝑥,𝑦

Proof of Theorem sprsymrelfvlem

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 488	. . . . 5 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → 𝑉 ∈ V)
2		eleq1 2853	. . . . . . . . . . . 12 ⊢ (𝑐 = {𝑥, 𝑦} → (𝑐 ∈ 𝑃 ↔ {𝑥, 𝑦} ∈ 𝑃))
3		prsssprel 48270	. . . . . . . . . . . . . . 15 ⊢ ((𝑃 ⊆ (Pairs‘𝑉) ∧ {𝑥, 𝑦} ∈ 𝑃 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))
4	3	3exp 1137	. . . . . . . . . . . . . 14 ⊢ (𝑃 ⊆ (Pairs‘𝑉) → ({𝑥, 𝑦} ∈ 𝑃 → ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))))
5	4	com13 89	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → ({𝑥, 𝑦} ∈ 𝑃 → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))))
6	5	el2v 3464	. . . . . . . . . . . 12 ⊢ ({𝑥, 𝑦} ∈ 𝑃 → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
7	2, 6	biimtrdi 256	. . . . . . . . . . 11 ⊢ (𝑐 = {𝑥, 𝑦} → (𝑐 ∈ 𝑃 → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))))
8	7	com12 33	. . . . . . . . . 10 ⊢ (𝑐 ∈ 𝑃 → (𝑐 = {𝑥, 𝑦} → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))))
9	8	rexlimiv 3161	. . . . . . . . 9 ⊢ (∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦} → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
10	9	com12 33	. . . . . . . 8 ⊢ (𝑃 ⊆ (Pairs‘𝑉) → (∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦} → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
11	10	adantl 487	. . . . . . 7 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → (∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦} → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
12	11	imp 412	. . . . . 6 ⊢ (((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))
13	12	simpld 500	. . . . 5 ⊢ (((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → 𝑥 ∈ 𝑉)
14	12	simprd 501	. . . . 5 ⊢ (((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → 𝑦 ∈ 𝑉)
15	1, 1, 13, 14	opabex2 8056	. . . 4 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ V)
16		elopab 5513	. . . . . . 7 ⊢ (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑥∃𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}))
17	9	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
18	17	adantld 496	. . . . . . . . . . 11 ⊢ ((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
19	18	imp 412	. . . . . . . . . 10 ⊢ (((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) ∧ (𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉))) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))
20		eleq1 2853	. . . . . . . . . . . 12 ⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → (𝑝 ∈ (𝑉 × 𝑉) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑉 × 𝑉)))
21	20	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) ∧ (𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉))) → (𝑝 ∈ (𝑉 × 𝑉) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑉 × 𝑉)))
22		opelxp 5699	. . . . . . . . . . 11 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝑉 × 𝑉) ↔ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))
23	21, 22	bitrdi 290	. . . . . . . . . 10 ⊢ (((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) ∧ (𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉))) → (𝑝 ∈ (𝑉 × 𝑉) ↔ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
24	19, 23	mpbird 260	. . . . . . . . 9 ⊢ (((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) ∧ (𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉))) → 𝑝 ∈ (𝑉 × 𝑉))
25	24	ex 418	. . . . . . . 8 ⊢ ((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → 𝑝 ∈ (𝑉 × 𝑉)))
26	25	exlimivv 1965	. . . . . . 7 ⊢ (∃𝑥∃𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → 𝑝 ∈ (𝑉 × 𝑉)))
27	16, 26	sylbi 220	. . . . . 6 ⊢ (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} → ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → 𝑝 ∈ (𝑉 × 𝑉)))
28	27	com12 33	. . . . 5 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} → 𝑝 ∈ (𝑉 × 𝑉)))
29	28	ssrdv 3944	. . . 4 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ⊆ (𝑉 × 𝑉))
30	15, 29	elpwd 4570	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉))
31	30	ex 418	. 2 ⊢ (𝑉 ∈ V → (𝑃 ⊆ (Pairs‘𝑉) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉)))
32		fvprc 6877	. . . . 5 ⊢ (¬ 𝑉 ∈ V → (Pairs‘𝑉) = ∅)
33	32	sseq2d 3970	. . . 4 ⊢ (¬ 𝑉 ∈ V → (𝑃 ⊆ (Pairs‘𝑉) ↔ 𝑃 ⊆ ∅))
34		ss0b 4358	. . . 4 ⊢ (𝑃 ⊆ ∅ ↔ 𝑃 = ∅)
35	33, 34	bitrdi 290	. . 3 ⊢ (¬ 𝑉 ∈ V → (𝑃 ⊆ (Pairs‘𝑉) ↔ 𝑃 = ∅))
36		rex0 4315	. . . . . . 7 ⊢ ¬ ∃𝑐 ∈ ∅ 𝑐 = {𝑥, 𝑦}
37		rexeq 3321	. . . . . . 7 ⊢ (𝑃 = ∅ → (∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐 ∈ ∅ 𝑐 = {𝑥, 𝑦}))
38	36, 37	mtbiri 330	. . . . . 6 ⊢ (𝑃 = ∅ → ¬ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦})
39	38	alrimivv 1961	. . . . 5 ⊢ (𝑃 = ∅ → ∀𝑥∀𝑦 ¬ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦})
40		opab0 5541	. . . . 5 ⊢ ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} = ∅ ↔ ∀𝑥∀𝑦 ¬ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦})
41	39, 40	sylibr 237	. . . 4 ⊢ (𝑃 = ∅ → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} = ∅)
42		0elpw 5328	. . . 4 ⊢ ∅ ∈ 𝒫 (𝑉 × 𝑉)
43	41, 42	eqeltrdi 2873	. . 3 ⊢ (𝑃 = ∅ → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉))
44	35, 43	biimtrdi 256	. 2 ⊢ (¬ 𝑉 ∈ V → (𝑃 ⊆ (Pairs‘𝑉) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉)))
45	31, 44	pm2.61i 184	1 ⊢ (𝑃 ⊆ (Pairs‘𝑉) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2146  ∃wrex 3091  Vcvv 3457   ⊆ wss 3906  ∅c0 4286  𝒫 cpw 4564  {cpr 4593  ⟨cop 4597  {copab 5175   × cxp 5661  ‘cfv 6540  Pairscspr 48259

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-spr 48260

This theorem is used by:  sprsymrelfv  48276  sprsymrelf  48277