Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sprsymrelf1lem Structured version   Visualization version   GIF version

Theorem sprsymrelf1lem 44008
Description: Lemma for sprsymrelf1 44013. (Contributed by AV, 22-Nov-2021.)
Assertion
Ref Expression
sprsymrelf1lem ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎𝑏))
Distinct variable groups:   𝑉,𝑐   𝑎,𝑏,𝑐,𝑥,𝑦
Allowed substitution hints:   𝑉(𝑥,𝑦,𝑎,𝑏)

Proof of Theorem sprsymrelf1lem
Dummy variables 𝑝 𝑖 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prssspr 44002 . . . . . 6 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑝𝑎) → ∃𝑖𝑉𝑗𝑉 𝑝 = {𝑖, 𝑗})
21ad4ant14 751 . . . . 5 ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → ∃𝑖𝑉𝑗𝑉 𝑝 = {𝑖, 𝑗})
3 simpr 488 . . . . . . . . . . . 12 (((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 = {𝑖, 𝑗})
43adantr 484 . . . . . . . . . . 11 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → 𝑝 = {𝑖, 𝑗})
54eleq1d 2874 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (𝑝𝑎 ↔ {𝑖, 𝑗} ∈ 𝑎))
6 simpr 488 . . . . . . . . . . . . . 14 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) → {𝑖, 𝑗} ∈ 𝑎)
7 eqeq1 2802 . . . . . . . . . . . . . . 15 (𝑐 = {𝑖, 𝑗} → (𝑐 = {𝑖, 𝑗} ↔ {𝑖, 𝑗} = {𝑖, 𝑗}))
87adantl 485 . . . . . . . . . . . . . 14 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) ∧ 𝑐 = {𝑖, 𝑗}) → (𝑐 = {𝑖, 𝑗} ↔ {𝑖, 𝑗} = {𝑖, 𝑗}))
9 eqidd 2799 . . . . . . . . . . . . . 14 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) → {𝑖, 𝑗} = {𝑖, 𝑗})
106, 8, 9rspcedvd 3574 . . . . . . . . . . . . 13 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) → ∃𝑐𝑎 𝑐 = {𝑖, 𝑗})
1110adantlr 714 . . . . . . . . . . . 12 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) ∧ {𝑖, 𝑗} ∈ 𝑎) → ∃𝑐𝑎 𝑐 = {𝑖, 𝑗})
12 preq12 4631 . . . . . . . . . . . . . . . . 17 ((𝑥 = 𝑖𝑦 = 𝑗) → {𝑥, 𝑦} = {𝑖, 𝑗})
1312eqeq2d 2809 . . . . . . . . . . . . . . . 16 ((𝑥 = 𝑖𝑦 = 𝑗) → (𝑐 = {𝑥, 𝑦} ↔ 𝑐 = {𝑖, 𝑗}))
1413rexbidv 3256 . . . . . . . . . . . . . . 15 ((𝑥 = 𝑖𝑦 = 𝑗) → (∃𝑐𝑎 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐𝑎 𝑐 = {𝑖, 𝑗}))
1514opelopabga 5385 . . . . . . . . . . . . . 14 ((𝑖𝑉𝑗𝑉) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑎 𝑐 = {𝑖, 𝑗}))
1615bicomd 226 . . . . . . . . . . . . 13 ((𝑖𝑉𝑗𝑉) → (∃𝑐𝑎 𝑐 = {𝑖, 𝑗} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
1716ad3antrrr 729 . . . . . . . . . . . 12 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) ∧ {𝑖, 𝑗} ∈ 𝑎) → (∃𝑐𝑎 𝑐 = {𝑖, 𝑗} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
1811, 17mpbid 235 . . . . . . . . . . 11 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) ∧ {𝑖, 𝑗} ∈ 𝑎) → ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}})
1918ex 416 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → ({𝑖, 𝑗} ∈ 𝑎 → ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
205, 19sylbid 243 . . . . . . . . 9 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (𝑝𝑎 → ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
21 eleq2 2878 . . . . . . . . . . 11 ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}))
2221ad2antll 728 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}))
2313rexbidv 3256 . . . . . . . . . . . . 13 ((𝑥 = 𝑖𝑦 = 𝑗) → (∃𝑐𝑏 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐𝑏 𝑐 = {𝑖, 𝑗}))
2423opelopabga 5385 . . . . . . . . . . . 12 ((𝑖 ∈ V ∧ 𝑗 ∈ V) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑏 𝑐 = {𝑖, 𝑗}))
2524el2v 3448 . . . . . . . . . . 11 (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑏 𝑐 = {𝑖, 𝑗})
26 eqtr3 2820 . . . . . . . . . . . . . . . . . . . . 21 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → 𝑝 = 𝑐)
2726equcomd 2026 . . . . . . . . . . . . . . . . . . . 20 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → 𝑐 = 𝑝)
2827eleq1d 2874 . . . . . . . . . . . . . . . . . . 19 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → (𝑐𝑏𝑝𝑏))
2928biimpd 232 . . . . . . . . . . . . . . . . . 18 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → (𝑐𝑏𝑝𝑏))
3029ex 416 . . . . . . . . . . . . . . . . 17 (𝑝 = {𝑖, 𝑗} → (𝑐 = {𝑖, 𝑗} → (𝑐𝑏𝑝𝑏)))
3130com13 88 . . . . . . . . . . . . . . . 16 (𝑐𝑏 → (𝑐 = {𝑖, 𝑗} → (𝑝 = {𝑖, 𝑗} → 𝑝𝑏)))
3231imp 410 . . . . . . . . . . . . . . 15 ((𝑐𝑏𝑐 = {𝑖, 𝑗}) → (𝑝 = {𝑖, 𝑗} → 𝑝𝑏))
3332rexlimiva 3240 . . . . . . . . . . . . . 14 (∃𝑐𝑏 𝑐 = {𝑖, 𝑗} → (𝑝 = {𝑖, 𝑗} → 𝑝𝑏))
3433com12 32 . . . . . . . . . . . . 13 (𝑝 = {𝑖, 𝑗} → (∃𝑐𝑏 𝑐 = {𝑖, 𝑗} → 𝑝𝑏))
3534adantl 485 . . . . . . . . . . . 12 (((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) → (∃𝑐𝑏 𝑐 = {𝑖, 𝑗} → 𝑝𝑏))
3635adantr 484 . . . . . . . . . . 11 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (∃𝑐𝑏 𝑐 = {𝑖, 𝑗} → 𝑝𝑏))
3725, 36syl5bi 245 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑝𝑏))
3822, 37sylbid 243 . . . . . . . . 9 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} → 𝑝𝑏))
3920, 38syld 47 . . . . . . . 8 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (𝑝𝑎𝑝𝑏))
4039expimpd 457 . . . . . . 7 (((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) → ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏))
4140rexlimdva2 3246 . . . . . 6 (𝑖𝑉 → (∃𝑗𝑉 𝑝 = {𝑖, 𝑗} → ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏)))
4241rexlimiv 3239 . . . . 5 (∃𝑖𝑉𝑗𝑉 𝑝 = {𝑖, 𝑗} → ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏))
432, 42mpcom 38 . . . 4 ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏)
4443ex 416 . . 3 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) → (𝑝𝑎𝑝𝑏))
4544ssrdv 3921 . 2 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑎𝑏)
4645ex 416 1 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎𝑏))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  wrex 3107  Vcvv 3441  wss 3881  {cpr 4527  cop 4531  {copab 5092  cfv 6324  Pairscspr 43994
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-spr 43995
This theorem is referenced by:  sprsymrelf1  44013
  Copyright terms: Public domain W3C validator