MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iunopeqop Structured version   Visualization version   GIF version

Theorem iunopeqop 5114
Description: Implication of an ordered pair being equal to an indexed union of singletons of ordered pairs. (Contributed by AV, 20-Sep-2020.) (Avoid depending on this detail.)
Hypotheses
Ref Expression
iunopeqop.b 𝐵 ∈ V
iunopeqop.c 𝐶 ∈ V
iunopeqop.d 𝐷 ∈ V
Assertion
Ref Expression
iunopeqop (𝐴 ≠ ∅ → ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧}))
Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐶   𝑥,𝐷
Allowed substitution hints:   𝐵(𝑥,𝑧)   𝐶(𝑧)   𝐷(𝑧)

Proof of Theorem iunopeqop
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 n0snor2el 4495 . 2 (𝐴 ≠ ∅ → (∃𝑥𝐴𝑦𝐴 𝑥𝑦 ∨ ∃𝑧 𝐴 = {𝑧}))
2 nfiu1 4682 . . . . . 6 𝑥 𝑥𝐴 {⟨𝑥, 𝐵⟩}
32nfeq1 2926 . . . . 5 𝑥 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷
4 nfv 1994 . . . . 5 𝑥𝑧 𝐴 = {𝑧}
53, 4nfim 1976 . . . 4 𝑥( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧})
6 ssiun2 4695 . . . . . . 7 (𝑥𝐴 → {⟨𝑥, 𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩})
7 nfcv 2912 . . . . . . . 8 𝑥𝑦
8 nfcsb1v 3696 . . . . . . . . . . 11 𝑥𝑦 / 𝑥𝐵
97, 8nfop 4553 . . . . . . . . . 10 𝑥𝑦, 𝑦 / 𝑥𝐵
109nfsn 4377 . . . . . . . . 9 𝑥{⟨𝑦, 𝑦 / 𝑥𝐵⟩}
1110, 2nfss 3743 . . . . . . . 8 𝑥{⟨𝑦, 𝑦 / 𝑥𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩}
12 id 22 . . . . . . . . . . 11 (𝑥 = 𝑦𝑥 = 𝑦)
13 csbeq1a 3689 . . . . . . . . . . 11 (𝑥 = 𝑦𝐵 = 𝑦 / 𝑥𝐵)
1412, 13opeq12d 4545 . . . . . . . . . 10 (𝑥 = 𝑦 → ⟨𝑥, 𝐵⟩ = ⟨𝑦, 𝑦 / 𝑥𝐵⟩)
1514sneqd 4326 . . . . . . . . 9 (𝑥 = 𝑦 → {⟨𝑥, 𝐵⟩} = {⟨𝑦, 𝑦 / 𝑥𝐵⟩})
1615sseq1d 3779 . . . . . . . 8 (𝑥 = 𝑦 → ({⟨𝑥, 𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩} ↔ {⟨𝑦, 𝑦 / 𝑥𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩}))
177, 11, 16, 6vtoclgaf 3420 . . . . . . 7 (𝑦𝐴 → {⟨𝑦, 𝑦 / 𝑥𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩})
186, 17anim12i 592 . . . . . 6 ((𝑥𝐴𝑦𝐴) → ({⟨𝑥, 𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩} ∧ {⟨𝑦, 𝑦 / 𝑥𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩}))
19 unss 3936 . . . . . . 7 (({⟨𝑥, 𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩} ∧ {⟨𝑦, 𝑦 / 𝑥𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩}) ↔ ({⟨𝑥, 𝐵⟩} ∪ {⟨𝑦, 𝑦 / 𝑥𝐵⟩}) ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩})
20 sseq2 3774 . . . . . . . . 9 ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → (({⟨𝑥, 𝐵⟩} ∪ {⟨𝑦, 𝑦 / 𝑥𝐵⟩}) ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩} ↔ ({⟨𝑥, 𝐵⟩} ∪ {⟨𝑦, 𝑦 / 𝑥𝐵⟩}) ⊆ ⟨𝐶, 𝐷⟩))
21 df-pr 4317 . . . . . . . . . . . 12 {⟨𝑥, 𝐵⟩, ⟨𝑦, 𝑦 / 𝑥𝐵⟩} = ({⟨𝑥, 𝐵⟩} ∪ {⟨𝑦, 𝑦 / 𝑥𝐵⟩})
2221eqcomi 2779 . . . . . . . . . . 11 ({⟨𝑥, 𝐵⟩} ∪ {⟨𝑦, 𝑦 / 𝑥𝐵⟩}) = {⟨𝑥, 𝐵⟩, ⟨𝑦, 𝑦 / 𝑥𝐵⟩}
2322sseq1i 3776 . . . . . . . . . 10 (({⟨𝑥, 𝐵⟩} ∪ {⟨𝑦, 𝑦 / 𝑥𝐵⟩}) ⊆ ⟨𝐶, 𝐷⟩ ↔ {⟨𝑥, 𝐵⟩, ⟨𝑦, 𝑦 / 𝑥𝐵⟩} ⊆ ⟨𝐶, 𝐷⟩)
24 vex 3352 . . . . . . . . . . . 12 𝑥 ∈ V
25 iunopeqop.b . . . . . . . . . . . 12 𝐵 ∈ V
26 vex 3352 . . . . . . . . . . . 12 𝑦 ∈ V
2725csbex 4924 . . . . . . . . . . . 12 𝑦 / 𝑥𝐵 ∈ V
28 iunopeqop.c . . . . . . . . . . . 12 𝐶 ∈ V
29 iunopeqop.d . . . . . . . . . . . 12 𝐷 ∈ V
3024, 25, 26, 27, 28, 29propssopi 5101 . . . . . . . . . . 11 ({⟨𝑥, 𝐵⟩, ⟨𝑦, 𝑦 / 𝑥𝐵⟩} ⊆ ⟨𝐶, 𝐷⟩ → 𝑥 = 𝑦)
31 eqneqall 2953 . . . . . . . . . . 11 (𝑥 = 𝑦 → (𝑥𝑦 → ((𝑥𝐴𝑦𝐴) → ∃𝑧 𝐴 = {𝑧})))
3230, 31syl 17 . . . . . . . . . 10 ({⟨𝑥, 𝐵⟩, ⟨𝑦, 𝑦 / 𝑥𝐵⟩} ⊆ ⟨𝐶, 𝐷⟩ → (𝑥𝑦 → ((𝑥𝐴𝑦𝐴) → ∃𝑧 𝐴 = {𝑧})))
3323, 32sylbi 207 . . . . . . . . 9 (({⟨𝑥, 𝐵⟩} ∪ {⟨𝑦, 𝑦 / 𝑥𝐵⟩}) ⊆ ⟨𝐶, 𝐷⟩ → (𝑥𝑦 → ((𝑥𝐴𝑦𝐴) → ∃𝑧 𝐴 = {𝑧})))
3420, 33syl6bi 243 . . . . . . . 8 ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → (({⟨𝑥, 𝐵⟩} ∪ {⟨𝑦, 𝑦 / 𝑥𝐵⟩}) ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩} → (𝑥𝑦 → ((𝑥𝐴𝑦𝐴) → ∃𝑧 𝐴 = {𝑧}))))
3534com14 96 . . . . . . 7 ((𝑥𝐴𝑦𝐴) → (({⟨𝑥, 𝐵⟩} ∪ {⟨𝑦, 𝑦 / 𝑥𝐵⟩}) ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩} → (𝑥𝑦 → ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧}))))
3619, 35syl5bi 232 . . . . . 6 ((𝑥𝐴𝑦𝐴) → (({⟨𝑥, 𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩} ∧ {⟨𝑦, 𝑦 / 𝑥𝐵⟩} ⊆ 𝑥𝐴 {⟨𝑥, 𝐵⟩}) → (𝑥𝑦 → ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧}))))
3718, 36mpd 15 . . . . 5 ((𝑥𝐴𝑦𝐴) → (𝑥𝑦 → ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧})))
3837rexlimdva 3178 . . . 4 (𝑥𝐴 → (∃𝑦𝐴 𝑥𝑦 → ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧})))
395, 38rexlimi 3171 . . 3 (∃𝑥𝐴𝑦𝐴 𝑥𝑦 → ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧}))
40 ax-1 6 . . 3 (∃𝑧 𝐴 = {𝑧} → ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧}))
4139, 40jaoi 837 . 2 ((∃𝑥𝐴𝑦𝐴 𝑥𝑦 ∨ ∃𝑧 𝐴 = {𝑧}) → ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧}))
421, 41syl 17 1 (𝐴 ≠ ∅ → ( 𝑥𝐴 {⟨𝑥, 𝐵⟩} = ⟨𝐶, 𝐷⟩ → ∃𝑧 𝐴 = {𝑧}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  wo 826   = wceq 1630  wex 1851  wcel 2144  wne 2942  wrex 3061  Vcvv 3349  csb 3680  cun 3719  wss 3721  c0 4061  {csn 4314  {cpr 4316  cop 4320   ciun 4652
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-sep 4912  ax-nul 4920  ax-pr 5034
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3an 1072  df-tru 1633  df-fal 1636  df-ex 1852  df-nf 1857  df-sb 2049  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-ral 3065  df-rex 3066  df-rab 3069  df-v 3351  df-sbc 3586  df-csb 3681  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-sn 4315  df-pr 4317  df-op 4321  df-iun 4654
This theorem is referenced by:  funopsn  6555
  Copyright terms: Public domain W3C validator