Theorem sprsymrelfvlem 48121

Description: Lemma for sprsymrelf 48126 and sprsymrelfv 48125. (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 487	. . . . 5 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → 𝑉 ∈ V)
2		eleq1 2857	. . . . . . . . . . . 12 ⊢ (𝑐 = {𝑥, 𝑦} → (𝑐 ∈ 𝑃 ↔ {𝑥, 𝑦} ∈ 𝑃))
3		prsssprel 48119	. . . . . . . . . . . . . . 15 ⊢ ((𝑃 ⊆ (Pairs‘𝑉) ∧ {𝑥, 𝑦} ∈ 𝑃 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))
4	3	3exp 1135	. . . . . . . . . . . . . 14 ⊢ (𝑃 ⊆ (Pairs‘𝑉) → ({𝑥, 𝑦} ∈ 𝑃 → ((𝑥 ∈ V ∧ 𝑦 ∈ V) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))))
5	4	com13 89	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → ({𝑥, 𝑦} ∈ 𝑃 → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))))
6	5	el2v 3470	. . . . . . . . . . . 12 ⊢ ({𝑥, 𝑦} ∈ 𝑃 → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
7	2, 6	biimtrdi 256	. . . . . . . . . . 11 ⊢ (𝑐 = {𝑥, 𝑦} → (𝑐 ∈ 𝑃 → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))))
8	7	com12 33	. . . . . . . . . 10 ⊢ (𝑐 ∈ 𝑃 → (𝑐 = {𝑥, 𝑦} → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))))
9	8	rexlimiv 3165	. . . . . . . . 9 ⊢ (∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦} → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
10	9	com12 33	. . . . . . . 8 ⊢ (𝑃 ⊆ (Pairs‘𝑉) → (∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦} → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
11	10	adantl 486	. . . . . . 7 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → (∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦} → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
12	11	imp 411	. . . . . 6 ⊢ (((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))
13	12	simpld 499	. . . . 5 ⊢ (((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → 𝑥 ∈ 𝑉)
14	12	simprd 500	. . . . 5 ⊢ (((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → 𝑦 ∈ 𝑉)
15	1, 1, 13, 14	opabex2 8050	. . . 4 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ V)
16		elopab 5509	. . . . . . 7 ⊢ (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑥∃𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}))
17	9	adantl 486	. . . . . . . . . . . 12 ⊢ ((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → (𝑃 ⊆ (Pairs‘𝑉) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
18	17	adantld 495	. . . . . . . . . . 11 ⊢ ((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
19	18	imp 411	. . . . . . . . . 10 ⊢ (((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) ∧ (𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉))) → (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))
20		eleq1 2857	. . . . . . . . . . . 12 ⊢ (𝑝 = ⟨𝑥, 𝑦⟩ → (𝑝 ∈ (𝑉 × 𝑉) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑉 × 𝑉)))
21	20	ad2antrr 738	. . . . . . . . . . 11 ⊢ (((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) ∧ (𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉))) → (𝑝 ∈ (𝑉 × 𝑉) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑉 × 𝑉)))
22		opelxp 5695	. . . . . . . . . . 11 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝑉 × 𝑉) ↔ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))
23	21, 22	bitrdi 290	. . . . . . . . . 10 ⊢ (((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) ∧ (𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉))) → (𝑝 ∈ (𝑉 × 𝑉) ↔ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
24	19, 23	mpbird 260	. . . . . . . . 9 ⊢ (((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) ∧ (𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉))) → 𝑝 ∈ (𝑉 × 𝑉))
25	24	ex 417	. . . . . . . 8 ⊢ ((𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → 𝑝 ∈ (𝑉 × 𝑉)))
26	25	exlimivv 1959	. . . . . . 7 ⊢ (∃𝑥∃𝑦(𝑝 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}) → ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → 𝑝 ∈ (𝑉 × 𝑉)))
27	16, 26	sylbi 220	. . . . . 6 ⊢ (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} → ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → 𝑝 ∈ (𝑉 × 𝑉)))
28	27	com12 33	. . . . 5 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → (𝑝 ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} → 𝑝 ∈ (𝑉 × 𝑉)))
29	28	ssrdv 3951	. . . 4 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ⊆ (𝑉 × 𝑉))
30	15, 29	elpwd 4570	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝑃 ⊆ (Pairs‘𝑉)) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉))
31	30	ex 417	. 2 ⊢ (𝑉 ∈ V → (𝑃 ⊆ (Pairs‘𝑉) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉)))
32		fvprc 6871	. . . . 5 ⊢ (¬ 𝑉 ∈ V → (Pairs‘𝑉) = ∅)
33	32	sseq2d 3977	. . . 4 ⊢ (¬ 𝑉 ∈ V → (𝑃 ⊆ (Pairs‘𝑉) ↔ 𝑃 ⊆ ∅))
34		ss0b 4364	. . . 4 ⊢ (𝑃 ⊆ ∅ ↔ 𝑃 = ∅)
35	33, 34	bitrdi 290	. . 3 ⊢ (¬ 𝑉 ∈ V → (𝑃 ⊆ (Pairs‘𝑉) ↔ 𝑃 = ∅))
36		rex0 4322	. . . . . . 7 ⊢ ¬ ∃𝑐 ∈ ∅ 𝑐 = {𝑥, 𝑦}
37		rexeq 3325	. . . . . . 7 ⊢ (𝑃 = ∅ → (∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐 ∈ ∅ 𝑐 = {𝑥, 𝑦}))
38	36, 37	mtbiri 330	. . . . . 6 ⊢ (𝑃 = ∅ → ¬ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦})
39	38	alrimivv 1955	. . . . 5 ⊢ (𝑃 = ∅ → ∀𝑥∀𝑦 ¬ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦})
40		opab0 5537	. . . . 5 ⊢ ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} = ∅ ↔ ∀𝑥∀𝑦 ¬ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦})
41	39, 40	sylibr 237	. . . 4 ⊢ (𝑃 = ∅ → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} = ∅)
42		0elpw 5324	. . . 4 ⊢ ∅ ∈ 𝒫 (𝑉 × 𝑉)
43	41, 42	eqeltrdi 2877	. . 3 ⊢ (𝑃 = ∅ → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉))
44	35, 43	biimtrdi 256	. 2 ⊢ (¬ 𝑉 ∈ V → (𝑃 ⊆ (Pairs‘𝑉) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉)))
45	31, 44	pm2.61i 184	1 ⊢ (𝑃 ⊆ (Pairs‘𝑉) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑐 ∈ 𝑃 𝑐 = {𝑥, 𝑦}} ∈ 𝒫 (𝑉 × 𝑉))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1565   = wceq 1567  ∃wex 1806   ∈ wcel 2149  ∃wrex 3095  Vcvv 3463   ⊆ wss 3913  ∅c0 4294  𝒫 cpw 4564  {cpr 4593  ⟨cop 4597  {copab 5174   × cxp 5657  ‘cfv 6533  Pairscspr 48108

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6489  df-fun 6535  df-fv 6541  df-spr 48109

This theorem is referenced by:  sprsymrelfv  48125  sprsymrelf  48126