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

Theorem pliguhgr 30515
Description: Any planar incidence geometry 𝐺 can be regarded as a hypergraph with its points as vertices and its lines as edges. See incistruhgr 29111 for a generalization of this case for arbitrary incidence structures (planar incidence geometries are such incidence structures). (Proposed by Gerard Lang, 24-Nov-2021.) (Contributed by AV, 28-Nov-2021.)
Assertion
Ref Expression
pliguhgr (𝐺 ∈ Plig → ⟨ 𝐺, ( I ↾ 𝐺)⟩ ∈ UHGraph)

Proof of Theorem pliguhgr
StepHypRef Expression
1 f1oi 6887 . . . 4 ( I ↾ 𝐺):𝐺1-1-onto𝐺
2 f1of 6849 . . . 4 (( I ↾ 𝐺):𝐺1-1-onto𝐺 → ( I ↾ 𝐺):𝐺𝐺)
3 pwuni 4950 . . . . . . 7 𝐺 ⊆ 𝒫 𝐺
4 n0lplig 30512 . . . . . . . . . 10 (𝐺 ∈ Plig → ¬ ∅ ∈ 𝐺)
54adantr 480 . . . . . . . . 9 ((𝐺 ∈ Plig ∧ 𝐺 ⊆ 𝒫 𝐺) → ¬ ∅ ∈ 𝐺)
6 disjsn 4716 . . . . . . . . 9 ((𝐺 ∩ {∅}) = ∅ ↔ ¬ ∅ ∈ 𝐺)
75, 6sylibr 234 . . . . . . . 8 ((𝐺 ∈ Plig ∧ 𝐺 ⊆ 𝒫 𝐺) → (𝐺 ∩ {∅}) = ∅)
8 reldisj 4459 . . . . . . . . 9 (𝐺 ⊆ 𝒫 𝐺 → ((𝐺 ∩ {∅}) = ∅ ↔ 𝐺 ⊆ (𝒫 𝐺 ∖ {∅})))
98adantl 481 . . . . . . . 8 ((𝐺 ∈ Plig ∧ 𝐺 ⊆ 𝒫 𝐺) → ((𝐺 ∩ {∅}) = ∅ ↔ 𝐺 ⊆ (𝒫 𝐺 ∖ {∅})))
107, 9mpbid 232 . . . . . . 7 ((𝐺 ∈ Plig ∧ 𝐺 ⊆ 𝒫 𝐺) → 𝐺 ⊆ (𝒫 𝐺 ∖ {∅}))
113, 10mpan2 691 . . . . . 6 (𝐺 ∈ Plig → 𝐺 ⊆ (𝒫 𝐺 ∖ {∅}))
12 fss 6753 . . . . . 6 ((( I ↾ 𝐺):𝐺𝐺𝐺 ⊆ (𝒫 𝐺 ∖ {∅})) → ( I ↾ 𝐺):𝐺⟶(𝒫 𝐺 ∖ {∅}))
1311, 12sylan2 593 . . . . 5 ((( I ↾ 𝐺):𝐺𝐺𝐺 ∈ Plig) → ( I ↾ 𝐺):𝐺⟶(𝒫 𝐺 ∖ {∅}))
1413ex 412 . . . 4 (( I ↾ 𝐺):𝐺𝐺 → (𝐺 ∈ Plig → ( I ↾ 𝐺):𝐺⟶(𝒫 𝐺 ∖ {∅})))
151, 2, 14mp2b 10 . . 3 (𝐺 ∈ Plig → ( I ↾ 𝐺):𝐺⟶(𝒫 𝐺 ∖ {∅}))
1615ffdmd 6767 . 2 (𝐺 ∈ Plig → ( I ↾ 𝐺):dom ( I ↾ 𝐺)⟶(𝒫 𝐺 ∖ {∅}))
17 uniexg 7759 . . 3 (𝐺 ∈ Plig → 𝐺 ∈ V)
18 resiexg 7935 . . 3 (𝐺 ∈ Plig → ( I ↾ 𝐺) ∈ V)
19 isuhgrop 29102 . . 3 (( 𝐺 ∈ V ∧ ( I ↾ 𝐺) ∈ V) → (⟨ 𝐺, ( I ↾ 𝐺)⟩ ∈ UHGraph ↔ ( I ↾ 𝐺):dom ( I ↾ 𝐺)⟶(𝒫 𝐺 ∖ {∅})))
2017, 18, 19syl2anc 584 . 2 (𝐺 ∈ Plig → (⟨ 𝐺, ( I ↾ 𝐺)⟩ ∈ UHGraph ↔ ( I ↾ 𝐺):dom ( I ↾ 𝐺)⟶(𝒫 𝐺 ∖ {∅})))
2116, 20mpbird 257 1 (𝐺 ∈ Plig → ⟨ 𝐺, ( I ↾ 𝐺)⟩ ∈ UHGraph)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  Vcvv 3478  cdif 3960  cin 3962  wss 3963  c0 4339  𝒫 cpw 4605  {csn 4631  cop 4637   cuni 4912   I cid 5582  dom cdm 5689  cres 5691  wf 6559  1-1-ontowf1o 6562  UHGraphcuhgr 29088  Pligcplig 30503
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-1st 8013  df-2nd 8014  df-vtx 29030  df-iedg 29031  df-uhgr 29090  df-plig 30504
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator