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

Theorem supisoex 9378
Description: Lemma for supiso 9379. (Contributed by Mario Carneiro, 24-Dec-2016.)
Hypotheses
Ref Expression
supiso.1 (𝜑𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵))
supiso.2 (𝜑𝐶𝐴)
supisoex.3 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)))
Assertion
Ref Expression
supisoex (𝜑 → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
Distinct variable groups:   𝑣,𝑢,𝑤,𝑥,𝑦,𝑧,𝐴   𝑢,𝐶,𝑣,𝑤,𝑥,𝑦,𝑧   𝜑,𝑢,𝑤   𝑢,𝐹,𝑣,𝑤,𝑥,𝑦,𝑧   𝑢,𝑅,𝑤,𝑥,𝑦,𝑧   𝑢,𝑆,𝑣,𝑤,𝑥,𝑦,𝑧   𝑢,𝐵,𝑣,𝑤,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑣)   𝑅(𝑣)

Proof of Theorem supisoex
StepHypRef Expression
1 supisoex.3 . 2 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)))
2 supiso.1 . . 3 (𝜑𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵))
3 supiso.2 . . 3 (𝜑𝐶𝐴)
4 simpl 482 . . . . . 6 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) → 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵))
5 simpr 484 . . . . . 6 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) → 𝐶𝐴)
64, 5supisolem 9377 . . . . 5 (((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) ∧ 𝑥𝐴) → ((∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)) ↔ (∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
7 isof1o 7269 . . . . . . . 8 (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐹:𝐴1-1-onto𝐵)
8 f1of 6774 . . . . . . . 8 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴𝐵)
94, 7, 83syl 18 . . . . . . 7 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) → 𝐹:𝐴𝐵)
109ffvelcdmda 7029 . . . . . 6 (((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ 𝐵)
11 breq1 5101 . . . . . . . . . . 11 (𝑢 = (𝐹𝑥) → (𝑢𝑆𝑤 ↔ (𝐹𝑥)𝑆𝑤))
1211notbid 318 . . . . . . . . . 10 (𝑢 = (𝐹𝑥) → (¬ 𝑢𝑆𝑤 ↔ ¬ (𝐹𝑥)𝑆𝑤))
1312ralbidv 3159 . . . . . . . . 9 (𝑢 = (𝐹𝑥) → (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ↔ ∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤))
14 breq2 5102 . . . . . . . . . . 11 (𝑢 = (𝐹𝑥) → (𝑤𝑆𝑢𝑤𝑆(𝐹𝑥)))
1514imbi1d 341 . . . . . . . . . 10 (𝑢 = (𝐹𝑥) → ((𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣) ↔ (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
1615ralbidv 3159 . . . . . . . . 9 (𝑢 = (𝐹𝑥) → (∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣) ↔ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
1713, 16anbi12d 632 . . . . . . . 8 (𝑢 = (𝐹𝑥) → ((∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)) ↔ (∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
1817rspcev 3576 . . . . . . 7 (((𝐹𝑥) ∈ 𝐵 ∧ (∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
1918ex 412 . . . . . 6 ((𝐹𝑥) ∈ 𝐵 → ((∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
2010, 19syl 17 . . . . 5 (((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) ∧ 𝑥𝐴) → ((∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
216, 20sylbid 240 . . . 4 (((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) ∧ 𝑥𝐴) → ((∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
2221rexlimdva 3137 . . 3 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) → (∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
232, 3, 22syl2anc 584 . 2 (𝜑 → (∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
241, 23mpd 15 1 (𝜑 → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1541  wcel 2113  wral 3051  wrex 3060  wss 3901   class class class wbr 5098  cima 5627  wf 6488  1-1-ontowf1o 6491  cfv 6492   Isom wiso 6493
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator